./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.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/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 102517b0f8c706bb18ba594655c7ea5e5902e987 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 102517b0f8c706bb18ba594655c7ea5e5902e987 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:21:36,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:21:36,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:21:36,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:21:36,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:21:36,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:21:36,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:21:36,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:21:36,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:21:36,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:21:36,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:21:36,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:21:36,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:21:36,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:21:36,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:21:36,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:21:36,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:21:36,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:21:36,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:21:36,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:21:36,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:21:36,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:21:36,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:21:36,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:21:36,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:21:36,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:21:36,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:21:36,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:21:36,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:21:36,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:21:36,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:21:36,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:21:36,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:21:36,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:21:36,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:21:36,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:21:36,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:21:36,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:21:36,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:21:36,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:21:36,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:21:36,482 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:21:36,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:21:36,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:21:36,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:21:36,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:21:36,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:21:36,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:21:36,513 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:21:36,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:21:36,514 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:21:36,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:21:36,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:21:36,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:21:36,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:21:36,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:21:36,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:21:36,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:36,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:21:36,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:21:36,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:21:36,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:21:36,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:21:36,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:21:36,517 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:21:36,517 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 -> 102517b0f8c706bb18ba594655c7ea5e5902e987 [2021-08-25 20:21:36,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:21:36,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:21:36,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:21:36,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:21:36,841 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:21:36,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:36,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18505367e/e7070f63c41b424095adb60e20fe152b/FLAGe3cfe77df [2021-08-25 20:21:37,312 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:21:37,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:37,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18505367e/e7070f63c41b424095adb60e20fe152b/FLAGe3cfe77df [2021-08-25 20:21:37,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18505367e/e7070f63c41b424095adb60e20fe152b [2021-08-25 20:21:37,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:21:37,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:21:37,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:37,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:21:37,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:21:37,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:37" (1/1) ... [2021-08-25 20:21:37,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132213e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:37, skipping insertion in model container [2021-08-25 20:21:37,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:37" (1/1) ... [2021-08-25 20:21:37,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:21:37,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:21:37,981 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/s3_srvr.blast.02.i.cil-1.c[71322,71335] [2021-08-25 20:21:37,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:38,005 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:21:38,101 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/s3_srvr.blast.02.i.cil-1.c[71322,71335] [2021-08-25 20:21:38,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:38,122 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:21:38,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38 WrapperNode [2021-08-25 20:21:38,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:38,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:38,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:21:38,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:21:38,130 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:21:38" (1/1) ... [2021-08-25 20:21:38,159 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:21:38" (1/1) ... [2021-08-25 20:21:38,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:38,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:21:38,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:21:38,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:21:38,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:21:38,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:21:38,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:21:38,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:21:38,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (1/1) ... [2021-08-25 20:21:38,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:21:38,310 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:21:38,331 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:21:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:21:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:21:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:21:38,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:21:38,570 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:21:39,258 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:21:39,259 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:21:39,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:21:39,269 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:21:39,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:39 BoogieIcfgContainer [2021-08-25 20:21:39,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:21:39,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:21:39,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:21:39,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:21:39,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:21:37" (1/3) ... [2021-08-25 20:21:39,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4788b509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:39, skipping insertion in model container [2021-08-25 20:21:39,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:38" (2/3) ... [2021-08-25 20:21:39,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4788b509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:39, skipping insertion in model container [2021-08-25 20:21:39,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:39" (3/3) ... [2021-08-25 20:21:39,279 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:39,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:21:39,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:21:39,321 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:21:39,327 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:21:39,327 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:21:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 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:21:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:21:39,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:39,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:39,356 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2021-08-25 20:21:39,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:39,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413981363] [2021-08-25 20:21:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:39,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:39,649 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:21:39,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:39,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413981363] [2021-08-25 20:21:39,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413981363] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:39,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:39,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:39,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474706692] [2021-08-25 20:21:39,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:39,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:39,674 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 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 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:40,086 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2021-08-25 20:21:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:40,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:21:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:40,096 INFO L225 Difference]: With dead ends: 313 [2021-08-25 20:21:40,096 INFO L226 Difference]: Without dead ends: 158 [2021-08-25 20:21:40,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-25 20:21:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-08-25 20:21:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.542857142857143) internal successors, (216), 140 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:21:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2021-08-25 20:21:40,138 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2021-08-25 20:21:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:40,139 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2021-08-25 20:21:40,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2021-08-25 20:21:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:21:40,144 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:40,145 INFO L512 BasicCegarLoop]: trace histogram [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:21:40,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:21:40,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2021-08-25 20:21:40,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:40,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543394615] [2021-08-25 20:21:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:40,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:40,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:40,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543394615] [2021-08-25 20:21:40,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543394615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:40,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:40,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:40,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462497955] [2021-08-25 20:21:40,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:40,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:40,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:40,221 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:21:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:40,466 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2021-08-25 20:21:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:40,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2021-08-25 20:21:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:40,468 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:21:40,468 INFO L226 Difference]: Without dead ends: 158 [2021-08-25 20:21:40,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-25 20:21:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2021-08-25 20:21:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 140 states have internal predecessors, (215), 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:21:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2021-08-25 20:21:40,474 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2021-08-25 20:21:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:40,474 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2021-08-25 20:21:40,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:21:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2021-08-25 20:21:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:40,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:40,476 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, 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:21:40,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:21:40,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2021-08-25 20:21:40,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:40,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372944032] [2021-08-25 20:21:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:40,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:40,536 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:21:40,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:40,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372944032] [2021-08-25 20:21:40,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372944032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:40,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:40,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:40,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105744473] [2021-08-25 20:21:40,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:40,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:40,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:40,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:40,538 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:40,769 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2021-08-25 20:21:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:40,770 INFO L225 Difference]: With dead ends: 279 [2021-08-25 20:21:40,770 INFO L226 Difference]: Without dead ends: 157 [2021-08-25 20:21:40,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-25 20:21:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2021-08-25 20:21:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 140 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:21:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2021-08-25 20:21:40,776 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2021-08-25 20:21:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:40,776 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2021-08-25 20:21:40,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2021-08-25 20:21:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:40,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:40,778 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:40,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:21:40,778 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2021-08-25 20:21:40,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:40,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210182081] [2021-08-25 20:21:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:40,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:40,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:40,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210182081] [2021-08-25 20:21:40,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210182081] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:40,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:40,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:40,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504671526] [2021-08-25 20:21:40,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:40,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:40,832 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:41,035 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2021-08-25 20:21:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:41,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:41,037 INFO L225 Difference]: With dead ends: 277 [2021-08-25 20:21:41,037 INFO L226 Difference]: Without dead ends: 155 [2021-08-25 20:21:41,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-25 20:21:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2021-08-25 20:21:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5214285714285714) internal successors, (213), 140 states have internal predecessors, (213), 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:21:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2021-08-25 20:21:41,042 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2021-08-25 20:21:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:41,042 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2021-08-25 20:21:41,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2021-08-25 20:21:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:41,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:41,043 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:41,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:21:41,044 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2021-08-25 20:21:41,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:41,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217189370] [2021-08-25 20:21:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:41,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:41,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:41,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217189370] [2021-08-25 20:21:41,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217189370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:41,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:41,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:41,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117559705] [2021-08-25 20:21:41,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:41,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:41,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:41,098 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:41,307 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2021-08-25 20:21:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:41,309 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:21:41,309 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:21:41,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:21:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:21:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 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:21:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2021-08-25 20:21:41,313 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2021-08-25 20:21:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:41,314 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2021-08-25 20:21:41,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2021-08-25 20:21:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:41,314 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:41,315 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:41,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:21:41,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2021-08-25 20:21:41,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:41,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937254498] [2021-08-25 20:21:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:41,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:41,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:41,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937254498] [2021-08-25 20:21:41,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937254498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:41,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:41,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:41,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387920646] [2021-08-25 20:21:41,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:41,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:41,382 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:41,584 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2021-08-25 20:21:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:41,586 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:21:41,586 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:21:41,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:21:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:21:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 140 states have internal predecessors, (211), 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:21:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2021-08-25 20:21:41,590 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2021-08-25 20:21:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:41,590 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2021-08-25 20:21:41,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2021-08-25 20:21:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:21:41,591 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:41,591 INFO L512 BasicCegarLoop]: trace histogram [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:21:41,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:21:41,591 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2021-08-25 20:21:41,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:41,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111828425] [2021-08-25 20:21:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:41,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:41,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:41,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111828425] [2021-08-25 20:21:41,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111828425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:41,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:41,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:41,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134144852] [2021-08-25 20:21:41,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:41,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:41,643 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:41,828 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2021-08-25 20:21:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:41,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-25 20:21:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:41,829 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:21:41,829 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:21:41,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:21:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:21:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5) internal successors, (210), 140 states have internal predecessors, (210), 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:21:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2021-08-25 20:21:41,832 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2021-08-25 20:21:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:41,832 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2021-08-25 20:21:41,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2021-08-25 20:21:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:21:41,833 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:41,833 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:41,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:21:41,833 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2021-08-25 20:21:41,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:41,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276297361] [2021-08-25 20:21:41,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:41,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:41,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:41,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276297361] [2021-08-25 20:21:41,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276297361] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:41,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:41,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:41,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406089870] [2021-08-25 20:21:41,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:41,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:41,906 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:21:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:42,105 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2021-08-25 20:21:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:42,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2021-08-25 20:21:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:42,106 INFO L225 Difference]: With dead ends: 276 [2021-08-25 20:21:42,106 INFO L226 Difference]: Without dead ends: 154 [2021-08-25 20:21:42,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-25 20:21:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-08-25 20:21:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 140 states have internal predecessors, (209), 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:21:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2021-08-25 20:21:42,109 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2021-08-25 20:21:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:42,109 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2021-08-25 20:21:42,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:21:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2021-08-25 20:21:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:21:42,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:42,110 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:42,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:21:42,110 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2021-08-25 20:21:42,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:42,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087720445] [2021-08-25 20:21:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:42,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:42,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:42,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087720445] [2021-08-25 20:21:42,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087720445] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:42,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:42,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:42,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950734232] [2021-08-25 20:21:42,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:42,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:42,180 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:21:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:42,355 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2021-08-25 20:21:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2021-08-25 20:21:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:42,356 INFO L225 Difference]: With dead ends: 266 [2021-08-25 20:21:42,357 INFO L226 Difference]: Without dead ends: 144 [2021-08-25 20:21:42,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-25 20:21:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2021-08-25 20:21:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 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:21:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2021-08-25 20:21:42,360 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2021-08-25 20:21:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:42,360 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2021-08-25 20:21:42,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:21:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2021-08-25 20:21:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:21:42,360 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:42,361 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:21:42,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:21:42,361 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2021-08-25 20:21:42,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:42,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98718400] [2021-08-25 20:21:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:42,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:42,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:42,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98718400] [2021-08-25 20:21:42,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98718400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:42,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:42,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:42,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97753417] [2021-08-25 20:21:42,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:42,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:42,433 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:21:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:42,646 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2021-08-25 20:21:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2021-08-25 20:21:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:42,648 INFO L225 Difference]: With dead ends: 307 [2021-08-25 20:21:42,648 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:21:42,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:21:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2021-08-25 20:21:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5185185185185186) internal successors, (246), 162 states have internal predecessors, (246), 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:21:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2021-08-25 20:21:42,651 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2021-08-25 20:21:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:42,651 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2021-08-25 20:21:42,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:21:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2021-08-25 20:21:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:21:42,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:42,652 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:42,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:21:42,652 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2021-08-25 20:21:42,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:42,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856162134] [2021-08-25 20:21:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:42,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:42,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:42,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856162134] [2021-08-25 20:21:42,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856162134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:42,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:42,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:42,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335036595] [2021-08-25 20:21:42,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:42,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:42,686 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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:21:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:42,889 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2021-08-25 20:21:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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 75 [2021-08-25 20:21:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:42,891 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:21:42,891 INFO L226 Difference]: Without dead ends: 185 [2021-08-25 20:21:42,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-25 20:21:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2021-08-25 20:21:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5123456790123457) internal successors, (245), 162 states have internal predecessors, (245), 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:21:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2021-08-25 20:21:42,894 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2021-08-25 20:21:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:42,894 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2021-08-25 20:21:42,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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:21:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2021-08-25 20:21:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:42,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:42,895 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-08-25 20:21:42,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:21:42,895 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2021-08-25 20:21:42,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:42,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903945144] [2021-08-25 20:21:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:42,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:42,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:42,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903945144] [2021-08-25 20:21:42,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903945144] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:42,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:42,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:42,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637281291] [2021-08-25 20:21:42,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:42,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:42,954 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:43,165 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2021-08-25 20:21:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:43,167 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:21:43,167 INFO L226 Difference]: Without dead ends: 184 [2021-08-25 20:21:43,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-25 20:21:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2021-08-25 20:21:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5061728395061729) internal successors, (244), 162 states have internal predecessors, (244), 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:21:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2021-08-25 20:21:43,170 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2021-08-25 20:21:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:43,170 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2021-08-25 20:21:43,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2021-08-25 20:21:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:43,170 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:43,170 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:43,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:21:43,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2021-08-25 20:21:43,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:43,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116292489] [2021-08-25 20:21:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:43,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:43,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:43,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116292489] [2021-08-25 20:21:43,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116292489] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:43,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:43,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:43,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484236708] [2021-08-25 20:21:43,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:43,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:43,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:43,213 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:43,401 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2021-08-25 20:21:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:43,402 INFO L225 Difference]: With dead ends: 326 [2021-08-25 20:21:43,402 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:21:43,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:21:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2021-08-25 20:21:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 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:21:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2021-08-25 20:21:43,406 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2021-08-25 20:21:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:43,406 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2021-08-25 20:21:43,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2021-08-25 20:21:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:43,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:43,407 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:43,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:21:43,407 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:43,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2021-08-25 20:21:43,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:43,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174887620] [2021-08-25 20:21:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:43,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:43,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:43,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174887620] [2021-08-25 20:21:43,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174887620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:43,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:43,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:43,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118668140] [2021-08-25 20:21:43,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:43,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:43,465 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:43,662 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2021-08-25 20:21:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:43,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:43,663 INFO L225 Difference]: With dead ends: 325 [2021-08-25 20:21:43,663 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:21:43,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:21:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-08-25 20:21:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 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:21:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2021-08-25 20:21:43,666 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2021-08-25 20:21:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:43,666 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2021-08-25 20:21:43,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2021-08-25 20:21:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:43,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:43,667 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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:21:43,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:21:43,667 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2021-08-25 20:21:43,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:43,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474755760] [2021-08-25 20:21:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:43,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:43,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:43,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474755760] [2021-08-25 20:21:43,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474755760] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:43,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:43,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:43,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651361609] [2021-08-25 20:21:43,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:43,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:43,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:43,704 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:43,884 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2021-08-25 20:21:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:43,885 INFO L225 Difference]: With dead ends: 325 [2021-08-25 20:21:43,885 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:21:43,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:21:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-08-25 20:21:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 162 states have internal predecessors, (241), 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:21:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2021-08-25 20:21:43,888 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2021-08-25 20:21:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:43,888 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2021-08-25 20:21:43,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2021-08-25 20:21:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:21:43,889 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:43,889 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:21:43,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:21:43,889 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2021-08-25 20:21:43,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:43,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061263191] [2021-08-25 20:21:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:43,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:43,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:43,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061263191] [2021-08-25 20:21:43,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061263191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:43,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:43,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:43,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594750938] [2021-08-25 20:21:43,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:43,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:43,932 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:21:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:44,153 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2021-08-25 20:21:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2021-08-25 20:21:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:44,155 INFO L225 Difference]: With dead ends: 325 [2021-08-25 20:21:44,155 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:21:44,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:21:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-08-25 20:21:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 162 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2021-08-25 20:21:44,158 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2021-08-25 20:21:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:44,158 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2021-08-25 20:21:44,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:21:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2021-08-25 20:21:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-25 20:21:44,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:44,159 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:44,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:21:44,159 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2021-08-25 20:21:44,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:44,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186125269] [2021-08-25 20:21:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:44,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:44,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:44,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186125269] [2021-08-25 20:21:44,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186125269] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:44,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:44,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:44,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365894432] [2021-08-25 20:21:44,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:44,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:44,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:44,198 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:21:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:44,392 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2021-08-25 20:21:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2021-08-25 20:21:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:44,393 INFO L225 Difference]: With dead ends: 325 [2021-08-25 20:21:44,393 INFO L226 Difference]: Without dead ends: 181 [2021-08-25 20:21:44,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-25 20:21:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2021-08-25 20:21:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 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:21:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-08-25 20:21:44,396 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2021-08-25 20:21:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:44,396 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-08-25 20:21:44,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:21:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-08-25 20:21:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-25 20:21:44,397 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:44,397 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:44,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:21:44,397 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2021-08-25 20:21:44,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:44,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680287814] [2021-08-25 20:21:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:44,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:44,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:44,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680287814] [2021-08-25 20:21:44,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680287814] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:44,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:44,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:44,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943601765] [2021-08-25 20:21:44,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:44,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:44,434 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:21:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:44,627 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2021-08-25 20:21:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:44,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2021-08-25 20:21:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:44,628 INFO L225 Difference]: With dead ends: 315 [2021-08-25 20:21:44,628 INFO L226 Difference]: Without dead ends: 171 [2021-08-25 20:21:44,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-25 20:21:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2021-08-25 20:21:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 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:21:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2021-08-25 20:21:44,631 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2021-08-25 20:21:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:44,631 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2021-08-25 20:21:44,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:21:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2021-08-25 20:21:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:21:44,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:44,632 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:44,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:21:44,632 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2021-08-25 20:21:44,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:44,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55090614] [2021-08-25 20:21:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:44,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:44,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:44,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55090614] [2021-08-25 20:21:44,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55090614] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:44,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:44,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:44,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598356944] [2021-08-25 20:21:44,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:44,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:44,681 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:44,961 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2021-08-25 20:21:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:44,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:21:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:44,963 INFO L225 Difference]: With dead ends: 403 [2021-08-25 20:21:44,963 INFO L226 Difference]: Without dead ends: 259 [2021-08-25 20:21:44,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-25 20:21:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2021-08-25 20:21:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.5414634146341464) internal successors, (316), 205 states have internal predecessors, (316), 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:21:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2021-08-25 20:21:44,967 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2021-08-25 20:21:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:44,967 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2021-08-25 20:21:44,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2021-08-25 20:21:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:21:44,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:44,968 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:44,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:21:44,968 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2021-08-25 20:21:44,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:44,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562686185] [2021-08-25 20:21:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:44,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:45,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:45,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562686185] [2021-08-25 20:21:45,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562686185] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:45,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:45,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:45,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826758855] [2021-08-25 20:21:45,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:45,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:45,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:45,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:45,012 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:45,271 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2021-08-25 20:21:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:45,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:21:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:45,272 INFO L225 Difference]: With dead ends: 443 [2021-08-25 20:21:45,273 INFO L226 Difference]: Without dead ends: 256 [2021-08-25 20:21:45,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:21:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-25 20:21:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2021-08-25 20:21:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5633187772925765) internal successors, (358), 229 states have internal predecessors, (358), 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:21:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2021-08-25 20:21:45,277 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2021-08-25 20:21:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:45,277 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2021-08-25 20:21:45,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2021-08-25 20:21:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:21:45,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:45,278 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:45,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:21:45,278 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2021-08-25 20:21:45,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:45,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67163886] [2021-08-25 20:21:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:45,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:45,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:45,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67163886] [2021-08-25 20:21:45,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67163886] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:45,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:45,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:45,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298809579] [2021-08-25 20:21:45,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:45,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:45,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:45,324 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:21:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:45,614 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2021-08-25 20:21:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:21:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:45,616 INFO L225 Difference]: With dead ends: 494 [2021-08-25 20:21:45,616 INFO L226 Difference]: Without dead ends: 283 [2021-08-25 20:21:45,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-25 20:21:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2021-08-25 20:21:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5589519650655022) internal successors, (357), 229 states have internal predecessors, (357), 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:21:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2021-08-25 20:21:45,620 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2021-08-25 20:21:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:45,621 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2021-08-25 20:21:45,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:21:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2021-08-25 20:21:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:21:45,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:45,622 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:45,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:21:45,622 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:45,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2021-08-25 20:21:45,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:45,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168668686] [2021-08-25 20:21:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:45,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:45,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:45,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168668686] [2021-08-25 20:21:45,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168668686] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:45,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:45,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:45,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632078709] [2021-08-25 20:21:45,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:45,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:45,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:45,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:45,661 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:21:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:45,906 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2021-08-25 20:21:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:21:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:45,908 INFO L225 Difference]: With dead ends: 467 [2021-08-25 20:21:45,908 INFO L226 Difference]: Without dead ends: 256 [2021-08-25 20:21:45,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:21:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-25 20:21:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2021-08-25 20:21:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.554585152838428) internal successors, (356), 229 states have internal predecessors, (356), 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:21:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2021-08-25 20:21:45,913 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2021-08-25 20:21:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:45,913 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2021-08-25 20:21:45,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:21:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-08-25 20:21:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:45,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:45,914 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:45,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:21:45,914 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:45,914 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2021-08-25 20:21:45,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:45,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034782735] [2021-08-25 20:21:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:45,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:45,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:45,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034782735] [2021-08-25 20:21:45,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034782735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:45,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:45,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:45,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451920193] [2021-08-25 20:21:45,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:45,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:45,984 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:46,252 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2021-08-25 20:21:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:46,253 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:21:46,254 INFO L226 Difference]: Without dead ends: 282 [2021-08-25 20:21:46,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-25 20:21:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2021-08-25 20:21:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 229 states have internal predecessors, (355), 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:21:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2021-08-25 20:21:46,257 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2021-08-25 20:21:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:46,258 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2021-08-25 20:21:46,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2021-08-25 20:21:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:46,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:46,258 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:46,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:21:46,259 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2021-08-25 20:21:46,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:46,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056117907] [2021-08-25 20:21:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:46,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:46,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:46,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056117907] [2021-08-25 20:21:46,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056117907] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:46,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:46,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:46,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715478006] [2021-08-25 20:21:46,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:46,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:46,294 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:46,566 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2021-08-25 20:21:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:46,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:46,567 INFO L225 Difference]: With dead ends: 491 [2021-08-25 20:21:46,567 INFO L226 Difference]: Without dead ends: 280 [2021-08-25 20:21:46,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-08-25 20:21:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2021-08-25 20:21:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 229 states have internal predecessors, (354), 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:21:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2021-08-25 20:21:46,571 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2021-08-25 20:21:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:46,571 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2021-08-25 20:21:46,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2021-08-25 20:21:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:46,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:46,572 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:46,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:21:46,572 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2021-08-25 20:21:46,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:46,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412631423] [2021-08-25 20:21:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:46,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:46,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:46,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412631423] [2021-08-25 20:21:46,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412631423] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:46,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:46,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:46,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575448038] [2021-08-25 20:21:46,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:46,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:46,634 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:46,898 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2021-08-25 20:21:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:46,900 INFO L225 Difference]: With dead ends: 490 [2021-08-25 20:21:46,900 INFO L226 Difference]: Without dead ends: 279 [2021-08-25 20:21:46,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-25 20:21:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2021-08-25 20:21:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5414847161572052) internal successors, (353), 229 states have internal predecessors, (353), 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:21:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2021-08-25 20:21:46,904 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2021-08-25 20:21:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:46,905 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2021-08-25 20:21:46,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2021-08-25 20:21:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:46,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:46,905 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:21:46,906 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2021-08-25 20:21:46,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:46,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963514562] [2021-08-25 20:21:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:46,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:21:46,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:46,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963514562] [2021-08-25 20:21:46,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963514562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:46,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:46,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:21:46,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610795898] [2021-08-25 20:21:46,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:21:46,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:21:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:46,952 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:47,229 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2021-08-25 20:21:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:21:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:47,231 INFO L225 Difference]: With dead ends: 462 [2021-08-25 20:21:47,231 INFO L226 Difference]: Without dead ends: 251 [2021-08-25 20:21:47,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:21:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-25 20:21:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2021-08-25 20:21:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5220883534136547) internal successors, (379), 249 states have internal predecessors, (379), 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:21:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2021-08-25 20:21:47,235 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2021-08-25 20:21:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:47,235 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2021-08-25 20:21:47,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2021-08-25 20:21:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:47,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:47,236 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:47,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:21:47,236 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2021-08-25 20:21:47,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:47,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621489932] [2021-08-25 20:21:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:47,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:47,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:47,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621489932] [2021-08-25 20:21:47,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621489932] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:47,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:47,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:47,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321615628] [2021-08-25 20:21:47,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:47,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:47,273 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:47,496 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2021-08-25 20:21:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:47,498 INFO L225 Difference]: With dead ends: 504 [2021-08-25 20:21:47,498 INFO L226 Difference]: Without dead ends: 273 [2021-08-25 20:21:47,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-25 20:21:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2021-08-25 20:21:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5180722891566265) internal successors, (378), 249 states have internal predecessors, (378), 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:21:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2021-08-25 20:21:47,503 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2021-08-25 20:21:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:47,503 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2021-08-25 20:21:47,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2021-08-25 20:21:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:47,504 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:47,504 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:47,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:21:47,504 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2021-08-25 20:21:47,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:47,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170093179] [2021-08-25 20:21:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:47,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:47,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:47,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170093179] [2021-08-25 20:21:47,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170093179] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:47,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:47,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:47,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147149240] [2021-08-25 20:21:47,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:47,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:47,544 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:47,755 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2021-08-25 20:21:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:47,756 INFO L225 Difference]: With dead ends: 503 [2021-08-25 20:21:47,756 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:21:47,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:21:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:21:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-08-25 20:21:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 249 states have internal predecessors, (377), 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:21:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2021-08-25 20:21:47,761 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2021-08-25 20:21:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:47,761 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2021-08-25 20:21:47,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2021-08-25 20:21:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:21:47,762 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:47,762 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:47,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:21:47,762 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2021-08-25 20:21:47,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:47,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733050033] [2021-08-25 20:21:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:47,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:47,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:47,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733050033] [2021-08-25 20:21:47,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733050033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:47,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:47,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:47,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961427068] [2021-08-25 20:21:47,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:47,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:47,799 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:21:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:48,067 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2021-08-25 20:21:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:21:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:48,069 INFO L225 Difference]: With dead ends: 530 [2021-08-25 20:21:48,069 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:21:48,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:21:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-08-25 20:21:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 249 states have internal predecessors, (376), 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:21:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2021-08-25 20:21:48,073 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2021-08-25 20:21:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:48,073 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2021-08-25 20:21:48,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:21:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2021-08-25 20:21:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:21:48,074 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:48,074 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:21:48,074 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2021-08-25 20:21:48,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:48,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409038379] [2021-08-25 20:21:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:48,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:48,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:48,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409038379] [2021-08-25 20:21:48,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409038379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:48,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:48,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:48,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907885539] [2021-08-25 20:21:48,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:48,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:48,117 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:21:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:48,321 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2021-08-25 20:21:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:21:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:48,323 INFO L225 Difference]: With dead ends: 503 [2021-08-25 20:21:48,323 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:21:48,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:21:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-08-25 20:21:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 249 states have internal predecessors, (375), 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:21:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2021-08-25 20:21:48,327 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2021-08-25 20:21:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:48,327 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2021-08-25 20:21:48,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:21:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2021-08-25 20:21:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:21:48,328 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:48,328 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:21:48,328 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2021-08-25 20:21:48,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:48,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614404258] [2021-08-25 20:21:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:48,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:48,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:48,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614404258] [2021-08-25 20:21:48,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614404258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:48,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:48,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:48,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332769578] [2021-08-25 20:21:48,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:48,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:48,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:48,371 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:21:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:48,638 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2021-08-25 20:21:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:21:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:48,640 INFO L225 Difference]: With dead ends: 530 [2021-08-25 20:21:48,640 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:21:48,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:21:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-08-25 20:21:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.502008032128514) internal successors, (374), 249 states have internal predecessors, (374), 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:21:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2021-08-25 20:21:48,644 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2021-08-25 20:21:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:48,644 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2021-08-25 20:21:48,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:21:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2021-08-25 20:21:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:21:48,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:48,645 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:21:48,646 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2021-08-25 20:21:48,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:48,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289138393] [2021-08-25 20:21:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:48,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:48,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:48,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289138393] [2021-08-25 20:21:48,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289138393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:48,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:48,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:48,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529344547] [2021-08-25 20:21:48,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:48,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:48,684 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:21:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:48,885 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2021-08-25 20:21:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:48,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:21:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:48,887 INFO L225 Difference]: With dead ends: 503 [2021-08-25 20:21:48,887 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:21:48,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:21:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-08-25 20:21:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.497991967871486) internal successors, (373), 249 states have internal predecessors, (373), 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:21:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2021-08-25 20:21:48,891 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2021-08-25 20:21:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:48,891 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2021-08-25 20:21:48,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:21:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2021-08-25 20:21:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:21:48,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:48,892 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:48,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:21:48,892 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2021-08-25 20:21:48,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:48,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852122311] [2021-08-25 20:21:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:48,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:48,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:48,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852122311] [2021-08-25 20:21:48,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852122311] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:48,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:48,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:48,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175786968] [2021-08-25 20:21:48,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:48,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:48,930 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:21:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:49,206 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2021-08-25 20:21:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:21:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:49,207 INFO L225 Difference]: With dead ends: 530 [2021-08-25 20:21:49,207 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:21:49,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:21:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2021-08-25 20:21:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4939759036144578) internal successors, (372), 249 states have internal predecessors, (372), 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:21:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2021-08-25 20:21:49,211 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2021-08-25 20:21:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:49,212 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2021-08-25 20:21:49,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:21:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2021-08-25 20:21:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:21:49,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:49,214 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:49,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:21:49,214 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:49,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2021-08-25 20:21:49,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:49,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927874412] [2021-08-25 20:21:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:49,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:49,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:49,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927874412] [2021-08-25 20:21:49,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927874412] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:49,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:49,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:49,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743384147] [2021-08-25 20:21:49,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:49,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:49,260 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:21:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:49,475 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2021-08-25 20:21:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:21:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:49,476 INFO L225 Difference]: With dead ends: 503 [2021-08-25 20:21:49,476 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 20:21:49,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 20:21:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2021-08-25 20:21:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4899598393574298) internal successors, (371), 249 states have internal predecessors, (371), 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:21:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2021-08-25 20:21:49,480 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2021-08-25 20:21:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:49,480 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2021-08-25 20:21:49,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:21:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2021-08-25 20:21:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:21:49,481 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:49,481 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:49,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:21:49,481 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2021-08-25 20:21:49,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:49,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870116184] [2021-08-25 20:21:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:49,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:49,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:49,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870116184] [2021-08-25 20:21:49,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870116184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:49,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:49,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:49,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995291562] [2021-08-25 20:21:49,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:49,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:49,520 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:21:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:49,781 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2021-08-25 20:21:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 102 [2021-08-25 20:21:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:49,782 INFO L225 Difference]: With dead ends: 520 [2021-08-25 20:21:49,782 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:21:49,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:21:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:21:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2021-08-25 20:21:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4859437751004017) internal successors, (370), 249 states have internal predecessors, (370), 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:21:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2021-08-25 20:21:49,786 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2021-08-25 20:21:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:49,786 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2021-08-25 20:21:49,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:21:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2021-08-25 20:21:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:21:49,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:49,787 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:49,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:21:49,787 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2021-08-25 20:21:49,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:49,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866884630] [2021-08-25 20:21:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:49,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:49,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:49,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866884630] [2021-08-25 20:21:49,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866884630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:49,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:49,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:49,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085996053] [2021-08-25 20:21:49,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:49,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:49,853 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:21:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:50,048 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2021-08-25 20:21:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 102 [2021-08-25 20:21:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:50,049 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:21:50,049 INFO L226 Difference]: Without dead ends: 262 [2021-08-25 20:21:50,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-25 20:21:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2021-08-25 20:21:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4819277108433735) internal successors, (369), 249 states have internal predecessors, (369), 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:21:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2021-08-25 20:21:50,065 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2021-08-25 20:21:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:50,065 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2021-08-25 20:21:50,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:21:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2021-08-25 20:21:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:50,066 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:50,066 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:50,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:21:50,066 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2021-08-25 20:21:50,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:50,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040902726] [2021-08-25 20:21:50,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:50,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:50,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:50,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040902726] [2021-08-25 20:21:50,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040902726] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:50,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:50,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:50,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917455591] [2021-08-25 20:21:50,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:50,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:50,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:50,101 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:21:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:50,357 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2021-08-25 20:21:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:21:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:50,358 INFO L225 Difference]: With dead ends: 520 [2021-08-25 20:21:50,358 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:21:50,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:21:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2021-08-25 20:21:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4779116465863453) internal successors, (368), 249 states have internal predecessors, (368), 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:21:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2021-08-25 20:21:50,362 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2021-08-25 20:21:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:50,363 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2021-08-25 20:21:50,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:21:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2021-08-25 20:21:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:50,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:50,363 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:50,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:21:50,364 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2021-08-25 20:21:50,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:50,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141278224] [2021-08-25 20:21:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:50,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:21:50,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:50,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141278224] [2021-08-25 20:21:50,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141278224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:50,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:50,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:50,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134437851] [2021-08-25 20:21:50,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:50,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,398 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:21:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:50,434 INFO L93 Difference]: Finished difference Result 708 states and 1057 transitions. [2021-08-25 20:21:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:21:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:50,436 INFO L225 Difference]: With dead ends: 708 [2021-08-25 20:21:50,436 INFO L226 Difference]: Without dead ends: 477 [2021-08-25 20:21:50,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-08-25 20:21:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2021-08-25 20:21:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4831932773109244) internal successors, (706), 476 states have internal predecessors, (706), 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:21:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 706 transitions. [2021-08-25 20:21:50,445 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 706 transitions. Word has length 106 [2021-08-25 20:21:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:50,446 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 706 transitions. [2021-08-25 20:21:50,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:21:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 706 transitions. [2021-08-25 20:21:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:21:50,447 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:50,447 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:50,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:21:50,448 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1521078267, now seen corresponding path program 1 times [2021-08-25 20:21:50,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:50,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503395435] [2021-08-25 20:21:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:50,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-25 20:21:50,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:50,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503395435] [2021-08-25 20:21:50,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503395435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:50,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:50,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:50,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323670065] [2021-08-25 20:21:50,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:50,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,475 INFO L87 Difference]: Start difference. First operand 477 states and 706 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:21:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:50,505 INFO L93 Difference]: Finished difference Result 962 states and 1427 transitions. [2021-08-25 20:21:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:21:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:50,507 INFO L225 Difference]: With dead ends: 962 [2021-08-25 20:21:50,507 INFO L226 Difference]: Without dead ends: 504 [2021-08-25 20:21:50,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-08-25 20:21:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2021-08-25 20:21:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.4731610337972167) internal successors, (741), 503 states have internal predecessors, (741), 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:21:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 741 transitions. [2021-08-25 20:21:50,518 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 741 transitions. Word has length 107 [2021-08-25 20:21:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:50,519 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 741 transitions. [2021-08-25 20:21:50,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:21:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 741 transitions. [2021-08-25 20:21:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:21:50,520 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:50,520 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:50,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:21:50,521 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1779195331, now seen corresponding path program 1 times [2021-08-25 20:21:50,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:50,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510908962] [2021-08-25 20:21:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:50,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-25 20:21:50,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:50,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510908962] [2021-08-25 20:21:50,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510908962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:50,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:50,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:50,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838120573] [2021-08-25 20:21:50,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:50,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,557 INFO L87 Difference]: Start difference. First operand 504 states and 741 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:50,571 INFO L93 Difference]: Finished difference Result 991 states and 1463 transitions. [2021-08-25 20:21:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-08-25 20:21:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:50,572 INFO L225 Difference]: With dead ends: 991 [2021-08-25 20:21:50,572 INFO L226 Difference]: Without dead ends: 506 [2021-08-25 20:21:50,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-08-25 20:21:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-08-25 20:21:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.4712871287128713) internal successors, (743), 505 states have internal predecessors, (743), 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:21:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 743 transitions. [2021-08-25 20:21:50,581 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 743 transitions. Word has length 107 [2021-08-25 20:21:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:50,581 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 743 transitions. [2021-08-25 20:21:50,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 743 transitions. [2021-08-25 20:21:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:21:50,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:50,582 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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:21:50,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:21:50,583 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2021-08-25 20:21:50,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:50,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549825594] [2021-08-25 20:21:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:50,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:50,688 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:21:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:50,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:21:50,789 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:21:50,790 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:21:50,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:21:50,795 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:21:50,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:21:50 BoogieIcfgContainer [2021-08-25 20:21:50,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:21:50,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:21:50,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:21:50,890 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:21:50,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:39" (3/4) ... [2021-08-25 20:21:50,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:21:50,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:21:50,894 INFO L168 Benchmark]: Toolchain (without parser) took 13274.36 ms. Allocated memory was 62.9 MB in the beginning and 325.1 MB in the end (delta: 262.1 MB). Free memory was 41.9 MB in the beginning and 258.2 MB in the end (delta: -216.3 MB). Peak memory consumption was 45.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,894 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 45.2 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:21:50,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.36 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 30.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 62.9 MB. Free memory was 30.5 MB in the beginning and 25.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,895 INFO L168 Benchmark]: Boogie Preprocessor took 72.52 ms. Allocated memory was 62.9 MB in the beginning and 90.2 MB in the end (delta: 27.3 MB). Free memory was 25.9 MB in the beginning and 64.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,895 INFO L168 Benchmark]: RCFGBuilder took 988.20 ms. Allocated memory is still 90.2 MB. Free memory was 64.5 MB in the beginning and 56.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,895 INFO L168 Benchmark]: TraceAbstraction took 11616.95 ms. Allocated memory was 90.2 MB in the beginning and 325.1 MB in the end (delta: 234.9 MB). Free memory was 55.5 MB in the beginning and 258.2 MB in the end (delta: -202.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:50,896 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 325.1 MB. Free memory is still 258.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:21:50,897 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.21 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 45.2 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 505.36 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 30.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 62.9 MB. Free memory was 30.5 MB in the beginning and 25.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.52 ms. Allocated memory was 62.9 MB in the beginning and 90.2 MB in the end (delta: 27.3 MB). Free memory was 25.9 MB in the beginning and 64.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 988.20 ms. Allocated memory is still 90.2 MB. Free memory was 64.5 MB in the beginning and 56.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11616.95 ms. Allocated memory was 90.2 MB in the beginning and 325.1 MB in the end (delta: 234.9 MB). Free memory was 55.5 MB in the beginning and 258.2 MB in the end (delta: -202.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.68 ms. Allocated memory is still 325.1 MB. Free memory is still 258.2 MB. There was no memory consumed. 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 - UnprovableResult [Line: 1704]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={5:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={5:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={5:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1353] COND FALSE !(ret <= 0) [L1358] s->hit VAL [init=1, SSLv3_server_data={5:0}] [L1358] COND TRUE s->hit [L1359] s->state = 8656 VAL [init=1, SSLv3_server_data={5:0}] [L1363] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1231] COND TRUE s->state == 8656 [L1556] EXPR s->session [L1556] EXPR s->s3 [L1556] EXPR (s->s3)->tmp.new_cipher [L1556] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1557] COND FALSE !(! tmp___9) [L1563] ret = __VERIFIER_nondet_int() [L1564] COND TRUE blastFlag == 2 [L1565] blastFlag = 3 VAL [init=1, SSLv3_server_data={5:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={5:0}] [L1704] reach_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11473.5ms, OverallIterations: 41, TraceHistogramMax: 4, EmptinessCheckTime: 45.4ms, AutomataDifference: 8803.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7552 SDtfs, 2146 SDslu, 11009 SDs, 0 SdLazy, 6885 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6596.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 452.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=40, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 194.4ms AutomataMinimizationTime, 40 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 148.4ms SsaConstructionTime, 531.4ms SatisfiabilityAnalysisTime, 1311.3ms InterpolantComputationTime, 3502 NumberOfCodeBlocks, 3502 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 9300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:21:50,929 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:21:52,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:21:52,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:21:52,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:21:52,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:21:52,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:21:52,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:21:52,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:21:52,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:21:52,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:21:52,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:21:52,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:21:52,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:21:52,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:21:52,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:21:52,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:21:52,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:21:52,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:21:52,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:21:52,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:21:52,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:21:52,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:21:52,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:21:52,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:21:52,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:21:52,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:21:52,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:21:52,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:21:52,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:21:52,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:21:52,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:21:52,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:21:52,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:21:52,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:21:52,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:21:52,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:21:52,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:21:52,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:21:52,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:21:52,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:21:52,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:21:52,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:21:52,747 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:21:52,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:21:52,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:21:52,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:21:52,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:21:52,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:21:52,749 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:21:52,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:21:52,749 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:21:52,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:21:52,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:21:52,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:21:52,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:21:52,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:52,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:21:52,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:21:52,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:21:52,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:21:52,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:21:52,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:21:52,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:21:52,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:21:52,753 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 102517b0f8c706bb18ba594655c7ea5e5902e987 [2021-08-25 20:21:52,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:21:52,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:21:52,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:21:52,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:21:52,971 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:21:52,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:53,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cff39012/2cd22fb6808e44619a0a4ef219775cda/FLAGdd5d1e224 [2021-08-25 20:21:53,504 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:21:53,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:53,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cff39012/2cd22fb6808e44619a0a4ef219775cda/FLAGdd5d1e224 [2021-08-25 20:21:53,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cff39012/2cd22fb6808e44619a0a4ef219775cda [2021-08-25 20:21:53,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:21:53,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:21:53,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:53,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:21:54,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:21:54,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:53" (1/1) ... [2021-08-25 20:21:54,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6202ae08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54, skipping insertion in model container [2021-08-25 20:21:54,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:53" (1/1) ... [2021-08-25 20:21:54,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:21:54,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:21:54,412 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/s3_srvr.blast.02.i.cil-1.c[71322,71335] [2021-08-25 20:21:54,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:54,446 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:21:54,541 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/s3_srvr.blast.02.i.cil-1.c[71322,71335] [2021-08-25 20:21:54,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:54,573 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:21:54,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54 WrapperNode [2021-08-25 20:21:54,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:54,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:54,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:21:54,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:21:54,579 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:21:54" (1/1) ... [2021-08-25 20:21:54,611 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:21:54" (1/1) ... [2021-08-25 20:21:54,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:54,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:21:54,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:21:54,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:21:54,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:21:54,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:21:54,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:21:54,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:21:54,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (1/1) ... [2021-08-25 20:21:54,760 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:54,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:21:54,774 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:21:54,794 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:21:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:21:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:21:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:21:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:21:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:21:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:21:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:21:54,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:21:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:21:55,077 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:21:56,130 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:21:56,130 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:21:56,135 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:21:56,135 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:21:56,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:56 BoogieIcfgContainer [2021-08-25 20:21:56,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:21:56,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:21:56,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:21:56,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:21:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:21:53" (1/3) ... [2021-08-25 20:21:56,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3786af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:56, skipping insertion in model container [2021-08-25 20:21:56,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:54" (2/3) ... [2021-08-25 20:21:56,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3786af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:56, skipping insertion in model container [2021-08-25 20:21:56,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:56" (3/3) ... [2021-08-25 20:21:56,158 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2021-08-25 20:21:56,161 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:21:56,161 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:21:56,234 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:21:56,238 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:21:56,238 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:21:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 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:21:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:21:56,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:56,266 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:56,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2021-08-25 20:21:56,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:56,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739085344] [2021-08-25 20:21:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:56,285 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:56,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:56,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:56,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:21:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:56,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:21:56,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:21:56,696 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:21:56,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:21:56,877 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:21:56,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:21:56,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739085344] [2021-08-25 20:21:56,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739085344] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:56,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:56,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:21:56,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854931867] [2021-08-25 20:21:56,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:56,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:21:56,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:56,891 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.7092198581560283) internal successors, (241), 142 states have internal predecessors, (241), 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 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:56,977 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2021-08-25 20:21:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:56,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:21:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:56,986 INFO L225 Difference]: With dead ends: 537 [2021-08-25 20:21:56,986 INFO L226 Difference]: Without dead ends: 363 [2021-08-25 20:21:56,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-08-25 20:21:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-08-25 20:21:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.522099447513812) internal successors, (551), 362 states have internal predecessors, (551), 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:21:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2021-08-25 20:21:57,042 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2021-08-25 20:21:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:57,043 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2021-08-25 20:21:57,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:21:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2021-08-25 20:21:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:21:57,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:57,047 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:21:57,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:21:57,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:57,255 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2021-08-25 20:21:57,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:57,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582178333] [2021-08-25 20:21:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:57,257 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:57,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:57,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:21:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:57,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:21:57,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:21:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:57,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:21:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:57,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:21:57,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582178333] [2021-08-25 20:21:57,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582178333] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:57,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:57,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:21:57,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693148889] [2021-08-25 20:21:57,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:57,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:21:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:57,999 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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:21:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:58,327 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2021-08-25 20:21:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:58,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 103 [2021-08-25 20:21:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:58,332 INFO L225 Difference]: With dead ends: 833 [2021-08-25 20:21:58,332 INFO L226 Difference]: Without dead ends: 597 [2021-08-25 20:21:58,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-08-25 20:21:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2021-08-25 20:21:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5184563758389262) internal successors, (905), 596 states have internal predecessors, (905), 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:21:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2021-08-25 20:21:58,378 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2021-08-25 20:21:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:58,379 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2021-08-25 20:21:58,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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:21:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2021-08-25 20:21:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:21:58,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:58,384 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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:21:58,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-25 20:21:58,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:58,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2021-08-25 20:21:58,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:58,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348344582] [2021-08-25 20:21:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:58,594 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:58,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:58,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:58,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:21:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:58,974 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:21:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:59,591 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:21:59,591 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:21:59,592 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:21:59,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:21:59,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:59,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:21:59,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:21:59 BoogieIcfgContainer [2021-08-25 20:21:59,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:21:59,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:21:59,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:21:59,972 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:21:59,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:56" (3/4) ... [2021-08-25 20:21:59,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:22:00,050 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:22:00,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:22:00,051 INFO L168 Benchmark]: Toolchain (without parser) took 6052.73 ms. Allocated memory was 75.5 MB in the beginning and 159.4 MB in the end (delta: 83.9 MB). Free memory was 54.4 MB in the beginning and 82.6 MB in the end (delta: -28.2 MB). Peak memory consumption was 54.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,052 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 75.5 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:22:00,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.87 ms. Allocated memory is still 75.5 MB. Free memory was 54.2 MB in the beginning and 35.7 MB in the end (delta: 18.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.57 ms. Allocated memory is still 75.5 MB. Free memory was 35.7 MB in the beginning and 53.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,052 INFO L168 Benchmark]: Boogie Preprocessor took 94.45 ms. Allocated memory is still 75.5 MB. Free memory was 53.5 MB in the beginning and 46.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,052 INFO L168 Benchmark]: RCFGBuilder took 1383.39 ms. Allocated memory was 75.5 MB in the beginning and 107.0 MB in the end (delta: 31.5 MB). Free memory was 46.6 MB in the beginning and 76.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,053 INFO L168 Benchmark]: TraceAbstraction took 3832.81 ms. Allocated memory was 107.0 MB in the beginning and 159.4 MB in the end (delta: 52.4 MB). Free memory was 76.4 MB in the beginning and 96.2 MB in the end (delta: -19.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,053 INFO L168 Benchmark]: Witness Printer took 78.78 ms. Allocated memory is still 159.4 MB. Free memory was 96.2 MB in the beginning and 82.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:22:00,054 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.15 ms. Allocated memory is still 75.5 MB. Free memory is still 56.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 574.87 ms. Allocated memory is still 75.5 MB. Free memory was 54.2 MB in the beginning and 35.7 MB in the end (delta: 18.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.57 ms. Allocated memory is still 75.5 MB. Free memory was 35.7 MB in the beginning and 53.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.45 ms. Allocated memory is still 75.5 MB. Free memory was 53.5 MB in the beginning and 46.6 MB in the end (delta: 6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1383.39 ms. Allocated memory was 75.5 MB in the beginning and 107.0 MB in the end (delta: 31.5 MB). Free memory was 46.6 MB in the beginning and 76.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3832.81 ms. Allocated memory was 107.0 MB in the beginning and 159.4 MB in the end (delta: 52.4 MB). Free memory was 76.4 MB in the beginning and 96.2 MB in the end (delta: -19.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB. * Witness Printer took 78.78 ms. Allocated memory is still 159.4 MB. Free memory was 96.2 MB in the beginning and 82.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1704]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1353] COND FALSE !(ret <= 0) [L1358] s->hit VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1358] COND TRUE s->hit [L1359] s->state = 8656 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1363] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND TRUE s->state == 8656 [L1556] EXPR s->session [L1556] EXPR s->s3 [L1556] EXPR (s->s3)->tmp.new_cipher [L1556] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1557] COND FALSE !(! tmp___9) [L1563] ret = __VERIFIER_nondet_int() [L1564] COND TRUE blastFlag == 2 [L1565] blastFlag = 3 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1704] reach_error() VAL [init=1, SSLv3_server_data={-2147483617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3587.7ms, OverallIterations: 3, TraceHistogramMax: 4, EmptinessCheckTime: 24.6ms, AutomataDifference: 440.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 588 SDtfs, 657 SDslu, 785 SDs, 0 SdLazy, 50 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 309.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 91.5ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 101.3ms SsaConstructionTime, 305.7ms SatisfiabilityAnalysisTime, 1011.0ms InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:22:00,096 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...