./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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.11.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:23:03,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:23:03,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:23:03,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:23:03,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:23:03,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:23:03,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:23:03,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:23:03,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:23:03,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:23:03,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:23:03,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:23:03,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:23:03,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:23:03,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:23:03,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:23:03,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:23:03,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:23:03,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:23:03,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:23:03,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:23:03,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:23:03,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:23:03,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:23:03,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:23:03,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:23:03,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:23:03,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:23:03,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:23:03,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:23:03,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:23:03,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:23:03,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:23:03,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:23:03,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:23:03,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:23:03,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:23:03,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:23:03,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:23:03,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:23:03,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:23:03,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:23:03,185 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:23:03,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:23:03,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:23:03,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:23:03,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:23:03,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:23:03,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:23:03,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:23:03,187 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:23:03,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:23:03,188 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:23:03,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:23:03,190 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:23:03,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:23:03,190 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:23:03,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:23:03,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:23:03,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:23:03,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:23:03,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:23:03,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:23:03,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:23:03,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:23:03,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:23:03,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:23:03,192 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:23:03,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:23:03,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:23:03,193 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:23:03,193 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2021-12-21 10:23:03,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:23:03,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:23:03,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:23:03,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:23:03,387 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:23:03,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:03,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7a7e211/5ab99cc6f2d54f4ca2a066d4ab4c8c12/FLAGacb71e1fd [2021-12-21 10:23:03,938 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:23:03,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:03,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7a7e211/5ab99cc6f2d54f4ca2a066d4ab4c8c12/FLAGacb71e1fd [2021-12-21 10:23:04,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7a7e211/5ab99cc6f2d54f4ca2a066d4ab4c8c12 [2021-12-21 10:23:04,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:23:04,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:23:04,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:23:04,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:23:04,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:23:04,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa1b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04, skipping insertion in model container [2021-12-21 10:23:04,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:23:04,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:23:04,800 WARN L230 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.11.i.cil-1.c[74369,74382] [2021-12-21 10:23:04,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:23:04,813 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:23:04,881 WARN L230 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.11.i.cil-1.c[74369,74382] [2021-12-21 10:23:04,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:23:04,893 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:23:04,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04 WrapperNode [2021-12-21 10:23:04,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:23:04,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:23:04,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:23:04,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:23:04,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,948 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2021-12-21 10:23:04,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:23:04,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:23:04,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:23:04,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:23:04,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:04,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:23:04,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:23:04,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:23:04,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:23:04,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (1/1) ... [2021-12-21 10:23:05,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:23:05,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:23:05,043 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-12-21 10:23:05,081 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-12-21 10:23:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:23:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:23:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:23:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:23:05,229 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:23:05,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:23:05,263 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 10:23:07,196 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-21 10:23:07,197 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-21 10:23:07,197 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:23:07,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:23:07,202 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 10:23:07,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:23:07 BoogieIcfgContainer [2021-12-21 10:23:07,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:23:07,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:23:07,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:23:07,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:23:07,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:23:04" (1/3) ... [2021-12-21 10:23:07,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e0046b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:23:07, skipping insertion in model container [2021-12-21 10:23:07,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:04" (2/3) ... [2021-12-21 10:23:07,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e0046b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:23:07, skipping insertion in model container [2021-12-21 10:23:07,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:23:07" (3/3) ... [2021-12-21 10:23:07,216 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:07,219 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:23:07,219 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:23:07,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:23:07,264 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-21 10:23:07,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:23:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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-12-21 10:23:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:23:07,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:07,293 INFO L514 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] [2021-12-21 10:23:07,293 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-12-21 10:23:07,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:07,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736346525] [2021-12-21 10:23:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:07,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:07,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:07,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736346525] [2021-12-21 10:23:07,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736346525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:07,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:07,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:07,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181029412] [2021-12-21 10:23:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:07,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:07,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:07,784 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:08,483 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2021-12-21 10:23:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:23:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:08,493 INFO L225 Difference]: With dead ends: 421 [2021-12-21 10:23:08,493 INFO L226 Difference]: Without dead ends: 256 [2021-12-21 10:23:08,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:08,497 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:08,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-21 10:23:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2021-12-21 10:23:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 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-12-21 10:23:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2021-12-21 10:23:08,530 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2021-12-21 10:23:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:08,531 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2021-12-21 10:23:08,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2021-12-21 10:23:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 10:23:08,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:08,534 INFO L514 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] [2021-12-21 10:23:08,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:23:08,535 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591931, now seen corresponding path program 1 times [2021-12-21 10:23:08,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:08,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687114721] [2021-12-21 10:23:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:08,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:08,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687114721] [2021-12-21 10:23:08,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687114721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:08,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:08,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:08,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125714401] [2021-12-21 10:23:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:08,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:08,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:08,707 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-21 10:23:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:09,262 INFO L93 Difference]: Finished difference Result 439 states and 692 transitions. [2021-12-21 10:23:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-12-21 10:23:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:09,264 INFO L225 Difference]: With dead ends: 439 [2021-12-21 10:23:09,264 INFO L226 Difference]: Without dead ends: 284 [2021-12-21 10:23:09,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:09,266 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:09,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-21 10:23:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2021-12-21 10:23:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 0 states have call successors, (0), 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-12-21 10:23:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions. [2021-12-21 10:23:09,275 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 38 [2021-12-21 10:23:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:09,276 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions. [2021-12-21 10:23:09,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-21 10:23:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions. [2021-12-21 10:23:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 10:23:09,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:09,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:23:09,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:23:09,278 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 917746377, now seen corresponding path program 1 times [2021-12-21 10:23:09,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786229180] [2021-12-21 10:23:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:09,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:09,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:09,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786229180] [2021-12-21 10:23:09,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786229180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:09,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:09,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:09,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655687014] [2021-12-21 10:23:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:09,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:09,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:09,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:09,362 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:10,031 INFO L93 Difference]: Finished difference Result 406 states and 651 transitions. [2021-12-21 10:23:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:10,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-21 10:23:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:10,033 INFO L225 Difference]: With dead ends: 406 [2021-12-21 10:23:10,033 INFO L226 Difference]: Without dead ends: 222 [2021-12-21 10:23:10,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:10,035 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:10,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 10:23:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-21 10:23:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2021-12-21 10:23:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6225490196078431) internal successors, (331), 204 states have internal predecessors, (331), 0 states have call successors, (0), 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-12-21 10:23:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions. [2021-12-21 10:23:10,043 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 44 [2021-12-21 10:23:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:10,043 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions. [2021-12-21 10:23:10,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions. [2021-12-21 10:23:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-21 10:23:10,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:10,045 INFO L514 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] [2021-12-21 10:23:10,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 10:23:10,045 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 868700126, now seen corresponding path program 1 times [2021-12-21 10:23:10,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:10,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688559242] [2021-12-21 10:23:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:10,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:10,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688559242] [2021-12-21 10:23:10,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688559242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:10,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:10,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:10,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348467158] [2021-12-21 10:23:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:10,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:10,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:10,157 INFO L87 Difference]: Start difference. First operand 205 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:10,702 INFO L93 Difference]: Finished difference Result 406 states and 650 transitions. [2021-12-21 10:23:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-21 10:23:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:10,704 INFO L225 Difference]: With dead ends: 406 [2021-12-21 10:23:10,704 INFO L226 Difference]: Without dead ends: 222 [2021-12-21 10:23:10,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:10,705 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:10,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 471 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-21 10:23:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2021-12-21 10:23:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 204 states have internal predecessors, (330), 0 states have call successors, (0), 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-12-21 10:23:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions. [2021-12-21 10:23:10,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 57 [2021-12-21 10:23:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:10,711 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions. [2021-12-21 10:23:10,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions. [2021-12-21 10:23:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 10:23:10,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:10,712 INFO L514 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] [2021-12-21 10:23:10,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 10:23:10,712 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash 642771885, now seen corresponding path program 1 times [2021-12-21 10:23:10,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:10,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780581260] [2021-12-21 10:23:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:10,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:10,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:10,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780581260] [2021-12-21 10:23:10,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780581260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:10,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:10,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:10,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452975079] [2021-12-21 10:23:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:10,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:10,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:10,808 INFO L87 Difference]: Start difference. First operand 205 states and 330 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-12-21 10:23:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:11,908 INFO L93 Difference]: Finished difference Result 405 states and 648 transitions. [2021-12-21 10:23:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:11,909 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-12-21 10:23:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:11,910 INFO L225 Difference]: With dead ends: 405 [2021-12-21 10:23:11,910 INFO L226 Difference]: Without dead ends: 221 [2021-12-21 10:23:11,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:11,911 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:11,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-21 10:23:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-21 10:23:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2021-12-21 10:23:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6127450980392157) internal successors, (329), 204 states have internal predecessors, (329), 0 states have call successors, (0), 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-12-21 10:23:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions. [2021-12-21 10:23:11,915 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 58 [2021-12-21 10:23:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:11,915 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions. [2021-12-21 10:23:11,915 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-12-21 10:23:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions. [2021-12-21 10:23:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 10:23:11,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:11,916 INFO L514 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] [2021-12-21 10:23:11,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 10:23:11,917 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -404738919, now seen corresponding path program 1 times [2021-12-21 10:23:11,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690844804] [2021-12-21 10:23:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:11,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:11,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:11,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690844804] [2021-12-21 10:23:11,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690844804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:11,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:11,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:11,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305140145] [2021-12-21 10:23:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:11,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:11,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:11,988 INFO L87 Difference]: Start difference. First operand 205 states and 329 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-12-21 10:23:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:12,547 INFO L93 Difference]: Finished difference Result 479 states and 760 transitions. [2021-12-21 10:23:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:12,548 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-12-21 10:23:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:12,549 INFO L225 Difference]: With dead ends: 479 [2021-12-21 10:23:12,549 INFO L226 Difference]: Without dead ends: 295 [2021-12-21 10:23:12,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:12,550 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:12,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-12-21 10:23:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205. [2021-12-21 10:23:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5980392156862746) internal successors, (326), 204 states have internal predecessors, (326), 0 states have call successors, (0), 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-12-21 10:23:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 326 transitions. [2021-12-21 10:23:12,555 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 326 transitions. Word has length 58 [2021-12-21 10:23:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:12,555 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 326 transitions. [2021-12-21 10:23:12,555 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-12-21 10:23:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 326 transitions. [2021-12-21 10:23:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 10:23:12,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:12,556 INFO L514 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] [2021-12-21 10:23:12,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 10:23:12,557 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1540605214, now seen corresponding path program 1 times [2021-12-21 10:23:12,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:12,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317759054] [2021-12-21 10:23:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:12,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:12,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:12,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317759054] [2021-12-21 10:23:12,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317759054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:12,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:12,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:12,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169145165] [2021-12-21 10:23:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:12,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:12,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:12,673 INFO L87 Difference]: Start difference. First operand 205 states and 326 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-12-21 10:23:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:13,490 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2021-12-21 10:23:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:13,491 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-12-21 10:23:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:13,492 INFO L225 Difference]: With dead ends: 478 [2021-12-21 10:23:13,492 INFO L226 Difference]: Without dead ends: 294 [2021-12-21 10:23:13,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:13,493 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:13,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-21 10:23:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-21 10:23:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2021-12-21 10:23:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 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-12-21 10:23:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2021-12-21 10:23:13,498 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 58 [2021-12-21 10:23:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:13,498 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2021-12-21 10:23:13,498 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-12-21 10:23:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2021-12-21 10:23:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 10:23:13,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:13,499 INFO L514 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] [2021-12-21 10:23:13,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 10:23:13,499 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash -219751902, now seen corresponding path program 1 times [2021-12-21 10:23:13,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:13,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457568987] [2021-12-21 10:23:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:13,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:13,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457568987] [2021-12-21 10:23:13,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457568987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:13,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:13,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:13,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225428439] [2021-12-21 10:23:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:13,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:13,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:13,606 INFO L87 Difference]: Start difference. First operand 205 states and 323 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-12-21 10:23:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:14,179 INFO L93 Difference]: Finished difference Result 478 states and 749 transitions. [2021-12-21 10:23:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:14,180 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-12-21 10:23:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:14,181 INFO L225 Difference]: With dead ends: 478 [2021-12-21 10:23:14,181 INFO L226 Difference]: Without dead ends: 294 [2021-12-21 10:23:14,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:14,182 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:14,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-21 10:23:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2021-12-21 10:23:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 204 states have internal predecessors, (320), 0 states have call successors, (0), 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-12-21 10:23:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2021-12-21 10:23:14,191 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 58 [2021-12-21 10:23:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:14,193 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2021-12-21 10:23:14,193 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-12-21 10:23:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2021-12-21 10:23:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 10:23:14,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:14,194 INFO L514 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] [2021-12-21 10:23:14,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 10:23:14,195 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1716593643, now seen corresponding path program 1 times [2021-12-21 10:23:14,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:14,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589897486] [2021-12-21 10:23:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:14,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:14,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589897486] [2021-12-21 10:23:14,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589897486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:14,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:14,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:14,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094900442] [2021-12-21 10:23:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:14,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:14,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:14,281 INFO L87 Difference]: Start difference. First operand 205 states and 320 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-12-21 10:23:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:14,736 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2021-12-21 10:23:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:14,737 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-12-21 10:23:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:14,738 INFO L225 Difference]: With dead ends: 478 [2021-12-21 10:23:14,738 INFO L226 Difference]: Without dead ends: 294 [2021-12-21 10:23:14,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:14,739 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:14,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 10:23:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-21 10:23:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2021-12-21 10:23:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.553921568627451) internal successors, (317), 204 states have internal predecessors, (317), 0 states have call successors, (0), 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-12-21 10:23:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2021-12-21 10:23:14,743 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 59 [2021-12-21 10:23:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:14,743 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2021-12-21 10:23:14,743 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-12-21 10:23:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2021-12-21 10:23:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 10:23:14,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:14,744 INFO L514 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] [2021-12-21 10:23:14,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 10:23:14,744 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1056186316, now seen corresponding path program 1 times [2021-12-21 10:23:14,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907865170] [2021-12-21 10:23:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:14,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:14,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907865170] [2021-12-21 10:23:14,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907865170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:14,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:14,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:14,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585749675] [2021-12-21 10:23:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:14,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:14,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:14,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:14,818 INFO L87 Difference]: Start difference. First operand 205 states and 317 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-12-21 10:23:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:15,390 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2021-12-21 10:23:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:15,390 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-12-21 10:23:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:15,391 INFO L225 Difference]: With dead ends: 402 [2021-12-21 10:23:15,391 INFO L226 Difference]: Without dead ends: 218 [2021-12-21 10:23:15,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:15,392 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:15,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-21 10:23:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2021-12-21 10:23:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 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-12-21 10:23:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 316 transitions. [2021-12-21 10:23:15,396 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 316 transitions. Word has length 60 [2021-12-21 10:23:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:15,396 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 316 transitions. [2021-12-21 10:23:15,396 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-12-21 10:23:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2021-12-21 10:23:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 10:23:15,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:15,397 INFO L514 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] [2021-12-21 10:23:15,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 10:23:15,397 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 614802448, now seen corresponding path program 1 times [2021-12-21 10:23:15,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:15,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903504247] [2021-12-21 10:23:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:15,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:15,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903504247] [2021-12-21 10:23:15,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903504247] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:15,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:15,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:15,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918292907] [2021-12-21 10:23:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:15,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:15,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:15,496 INFO L87 Difference]: Start difference. First operand 205 states and 316 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-12-21 10:23:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:16,050 INFO L93 Difference]: Finished difference Result 478 states and 738 transitions. [2021-12-21 10:23:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:16,051 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-12-21 10:23:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:16,052 INFO L225 Difference]: With dead ends: 478 [2021-12-21 10:23:16,052 INFO L226 Difference]: Without dead ends: 294 [2021-12-21 10:23:16,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:16,053 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:16,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-21 10:23:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2021-12-21 10:23:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 204 states have internal predecessors, (313), 0 states have call successors, (0), 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-12-21 10:23:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2021-12-21 10:23:16,057 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 61 [2021-12-21 10:23:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:16,058 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2021-12-21 10:23:16,058 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-12-21 10:23:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2021-12-21 10:23:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 10:23:16,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:16,058 INFO L514 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] [2021-12-21 10:23:16,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 10:23:16,058 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2021-12-21 10:23:16,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:16,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630784171] [2021-12-21 10:23:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:16,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:16,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:16,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630784171] [2021-12-21 10:23:16,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630784171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:16,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:16,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:16,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984700682] [2021-12-21 10:23:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:16,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:16,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:16,141 INFO L87 Difference]: Start difference. First operand 205 states and 313 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-12-21 10:23:17,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 10:23:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:17,521 INFO L93 Difference]: Finished difference Result 508 states and 780 transitions. [2021-12-21 10:23:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:17,522 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-12-21 10:23:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:17,523 INFO L225 Difference]: With dead ends: 508 [2021-12-21 10:23:17,523 INFO L226 Difference]: Without dead ends: 324 [2021-12-21 10:23:17,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:17,524 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:17,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-21 10:23:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-21 10:23:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2021-12-21 10:23:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5532786885245902) internal successors, (379), 244 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-12-21 10:23:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2021-12-21 10:23:17,528 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 61 [2021-12-21 10:23:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:17,528 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2021-12-21 10:23:17,528 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-12-21 10:23:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2021-12-21 10:23:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-21 10:23:17,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:17,529 INFO L514 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-12-21 10:23:17,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 10:23:17,529 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1049026987, now seen corresponding path program 1 times [2021-12-21 10:23:17,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:17,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549473809] [2021-12-21 10:23:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:17,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:17,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:17,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549473809] [2021-12-21 10:23:17,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549473809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:17,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:17,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:17,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796582202] [2021-12-21 10:23:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:17,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:17,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:17,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:17,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:17,610 INFO L87 Difference]: Start difference. First operand 245 states and 379 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-12-21 10:23:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:17,943 INFO L93 Difference]: Finished difference Result 511 states and 793 transitions. [2021-12-21 10:23:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:17,944 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-12-21 10:23:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:17,945 INFO L225 Difference]: With dead ends: 511 [2021-12-21 10:23:17,945 INFO L226 Difference]: Without dead ends: 287 [2021-12-21 10:23:17,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:17,946 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 29 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:17,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 493 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 10:23:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-21 10:23:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2021-12-21 10:23:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5488721804511278) internal successors, (412), 266 states have internal predecessors, (412), 0 states have call successors, (0), 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-12-21 10:23:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 412 transitions. [2021-12-21 10:23:17,950 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 412 transitions. Word has length 62 [2021-12-21 10:23:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:17,950 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 412 transitions. [2021-12-21 10:23:17,950 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-12-21 10:23:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 412 transitions. [2021-12-21 10:23:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 10:23:17,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:17,951 INFO L514 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-12-21 10:23:17,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 10:23:17,952 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1947485908, now seen corresponding path program 1 times [2021-12-21 10:23:17,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:17,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035667715] [2021-12-21 10:23:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:17,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:18,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:18,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035667715] [2021-12-21 10:23:18,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035667715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:18,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:18,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:18,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246392785] [2021-12-21 10:23:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:18,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:18,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:18,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:18,038 INFO L87 Difference]: Start difference. First operand 267 states and 412 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-12-21 10:23:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:19,070 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions. [2021-12-21 10:23:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:19,071 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-12-21 10:23:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:19,072 INFO L225 Difference]: With dead ends: 531 [2021-12-21 10:23:19,072 INFO L226 Difference]: Without dead ends: 285 [2021-12-21 10:23:19,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:19,073 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:19,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 10:23:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-21 10:23:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267. [2021-12-21 10:23:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 266 states have internal predecessors, (411), 0 states have call successors, (0), 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-12-21 10:23:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2021-12-21 10:23:19,078 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 75 [2021-12-21 10:23:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:19,078 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2021-12-21 10:23:19,078 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-12-21 10:23:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2021-12-21 10:23:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-21 10:23:19,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:19,079 INFO L514 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-12-21 10:23:19,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 10:23:19,080 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash -655331449, now seen corresponding path program 1 times [2021-12-21 10:23:19,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824460205] [2021-12-21 10:23:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:19,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:19,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824460205] [2021-12-21 10:23:19,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824460205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:19,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:19,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:19,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175549664] [2021-12-21 10:23:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:19,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:19,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:19,169 INFO L87 Difference]: Start difference. First operand 267 states and 411 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-12-21 10:23:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:19,653 INFO L93 Difference]: Finished difference Result 530 states and 820 transitions. [2021-12-21 10:23:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:19,653 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-12-21 10:23:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:19,654 INFO L225 Difference]: With dead ends: 530 [2021-12-21 10:23:19,654 INFO L226 Difference]: Without dead ends: 284 [2021-12-21 10:23:19,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:19,655 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:19,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-21 10:23:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2021-12-21 10:23:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 266 states have internal predecessors, (410), 0 states have call successors, (0), 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-12-21 10:23:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2021-12-21 10:23:19,659 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 76 [2021-12-21 10:23:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:19,660 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2021-12-21 10:23:19,660 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-12-21 10:23:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2021-12-21 10:23:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-21 10:23:19,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:19,660 INFO L514 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-12-21 10:23:19,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 10:23:19,660 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash 280248224, now seen corresponding path program 1 times [2021-12-21 10:23:19,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:19,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835878687] [2021-12-21 10:23:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:19,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:19,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835878687] [2021-12-21 10:23:19,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835878687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:19,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:19,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:19,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54793253] [2021-12-21 10:23:19,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:19,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:19,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:19,741 INFO L87 Difference]: Start difference. First operand 267 states and 410 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-12-21 10:23:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:20,389 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions. [2021-12-21 10:23:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:20,389 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-12-21 10:23:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:20,391 INFO L225 Difference]: With dead ends: 602 [2021-12-21 10:23:20,391 INFO L226 Difference]: Without dead ends: 356 [2021-12-21 10:23:20,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:20,391 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:20,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-12-21 10:23:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2021-12-21 10:23:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5263157894736843) internal successors, (406), 266 states have internal predecessors, (406), 0 states have call successors, (0), 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-12-21 10:23:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2021-12-21 10:23:20,397 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 78 [2021-12-21 10:23:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:20,397 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2021-12-21 10:23:20,398 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-12-21 10:23:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2021-12-21 10:23:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-21 10:23:20,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:20,398 INFO L514 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-12-21 10:23:20,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 10:23:20,399 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2021-12-21 10:23:20,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:20,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811595432] [2021-12-21 10:23:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:20,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:20,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:20,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811595432] [2021-12-21 10:23:20,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811595432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:20,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:20,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:20,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014097753] [2021-12-21 10:23:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:20,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:20,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:20,492 INFO L87 Difference]: Start difference. First operand 267 states and 406 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-12-21 10:23:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:21,314 INFO L93 Difference]: Finished difference Result 603 states and 918 transitions. [2021-12-21 10:23:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:21,315 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-12-21 10:23:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:21,317 INFO L225 Difference]: With dead ends: 603 [2021-12-21 10:23:21,317 INFO L226 Difference]: Without dead ends: 357 [2021-12-21 10:23:21,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:21,317 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 67 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:21,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-21 10:23:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-21 10:23:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2021-12-21 10:23:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5357142857142858) internal successors, (473), 308 states have internal predecessors, (473), 0 states have call successors, (0), 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-12-21 10:23:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2021-12-21 10:23:21,323 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 84 [2021-12-21 10:23:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:21,323 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2021-12-21 10:23:21,323 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-12-21 10:23:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2021-12-21 10:23:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-21 10:23:21,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:21,324 INFO L514 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-12-21 10:23:21,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 10:23:21,325 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash -921185757, now seen corresponding path program 1 times [2021-12-21 10:23:21,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897319711] [2021-12-21 10:23:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:21,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:21,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:21,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897319711] [2021-12-21 10:23:21,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897319711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:21,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:21,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:21,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615930972] [2021-12-21 10:23:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:21,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:21,398 INFO L87 Difference]: Start difference. First operand 309 states and 473 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-12-21 10:23:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:22,054 INFO L93 Difference]: Finished difference Result 646 states and 991 transitions. [2021-12-21 10:23:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:22,054 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-12-21 10:23:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:22,056 INFO L225 Difference]: With dead ends: 646 [2021-12-21 10:23:22,056 INFO L226 Difference]: Without dead ends: 358 [2021-12-21 10:23:22,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:22,056 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:22,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 591 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-12-21 10:23:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333. [2021-12-21 10:23:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.533132530120482) internal successors, (509), 332 states have internal predecessors, (509), 0 states have call successors, (0), 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-12-21 10:23:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions. [2021-12-21 10:23:22,062 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 84 [2021-12-21 10:23:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:22,062 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions. [2021-12-21 10:23:22,062 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-12-21 10:23:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions. [2021-12-21 10:23:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-21 10:23:22,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:22,063 INFO L514 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-12-21 10:23:22,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 10:23:22,064 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 742972446, now seen corresponding path program 1 times [2021-12-21 10:23:22,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:22,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603678292] [2021-12-21 10:23:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:22,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:22,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:22,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603678292] [2021-12-21 10:23:22,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603678292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:22,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:22,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:22,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822319050] [2021-12-21 10:23:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:22,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:22,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:22,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:22,155 INFO L87 Difference]: Start difference. First operand 333 states and 509 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-12-21 10:23:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:23,096 INFO L93 Difference]: Finished difference Result 771 states and 1187 transitions. [2021-12-21 10:23:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:23,098 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-12-21 10:23:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:23,100 INFO L225 Difference]: With dead ends: 771 [2021-12-21 10:23:23,100 INFO L226 Difference]: Without dead ends: 459 [2021-12-21 10:23:23,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:23,101 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:23,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-21 10:23:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-21 10:23:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2021-12-21 10:23:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.514367816091954) internal successors, (527), 348 states have internal predecessors, (527), 0 states have call successors, (0), 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-12-21 10:23:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 527 transitions. [2021-12-21 10:23:23,110 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 527 transitions. Word has length 97 [2021-12-21 10:23:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:23,110 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 527 transitions. [2021-12-21 10:23:23,110 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-12-21 10:23:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 527 transitions. [2021-12-21 10:23:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-21 10:23:23,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:23,114 INFO L514 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-12-21 10:23:23,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 10:23:23,114 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash 659456893, now seen corresponding path program 1 times [2021-12-21 10:23:23,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:23,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123916626] [2021-12-21 10:23:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:23,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:23,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:23,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123916626] [2021-12-21 10:23:23,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123916626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:23,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:23,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:23,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402213878] [2021-12-21 10:23:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:23,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:23,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:23,263 INFO L87 Difference]: Start difference. First operand 349 states and 527 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-12-21 10:23:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:24,484 INFO L93 Difference]: Finished difference Result 755 states and 1147 transitions. [2021-12-21 10:23:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:24,484 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-12-21 10:23:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:24,486 INFO L225 Difference]: With dead ends: 755 [2021-12-21 10:23:24,486 INFO L226 Difference]: Without dead ends: 427 [2021-12-21 10:23:24,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:24,487 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:24,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 10:23:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-12-21 10:23:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2021-12-21 10:23:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4971264367816093) internal successors, (521), 348 states have internal predecessors, (521), 0 states have call successors, (0), 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-12-21 10:23:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 521 transitions. [2021-12-21 10:23:24,492 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 521 transitions. Word has length 98 [2021-12-21 10:23:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:24,493 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 521 transitions. [2021-12-21 10:23:24,493 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-12-21 10:23:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 521 transitions. [2021-12-21 10:23:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-21 10:23:24,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:24,494 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-12-21 10:23:24,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 10:23:24,494 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 280390343, now seen corresponding path program 1 times [2021-12-21 10:23:24,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:24,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552689473] [2021-12-21 10:23:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:24,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:24,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:24,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552689473] [2021-12-21 10:23:24,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552689473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:24,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:24,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:24,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765248901] [2021-12-21 10:23:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:24,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:24,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:24,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:24,592 INFO L87 Difference]: Start difference. First operand 349 states and 521 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-12-21 10:23:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:25,327 INFO L93 Difference]: Finished difference Result 712 states and 1064 transitions. [2021-12-21 10:23:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:25,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 104 [2021-12-21 10:23:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:25,329 INFO L225 Difference]: With dead ends: 712 [2021-12-21 10:23:25,329 INFO L226 Difference]: Without dead ends: 384 [2021-12-21 10:23:25,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:25,330 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:25,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 489 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 10:23:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-12-21 10:23:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 349. [2021-12-21 10:23:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4942528735632183) internal successors, (520), 348 states have internal predecessors, (520), 0 states have call successors, (0), 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-12-21 10:23:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 520 transitions. [2021-12-21 10:23:25,335 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 520 transitions. Word has length 104 [2021-12-21 10:23:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:25,336 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 520 transitions. [2021-12-21 10:23:25,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-12-21 10:23:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 520 transitions. [2021-12-21 10:23:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 10:23:25,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:25,338 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-12-21 10:23:25,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 10:23:25,338 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 509759261, now seen corresponding path program 1 times [2021-12-21 10:23:25,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806843229] [2021-12-21 10:23:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:25,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:25,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:25,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806843229] [2021-12-21 10:23:25,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806843229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:25,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:25,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:25,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579815615] [2021-12-21 10:23:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:25,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:25,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:25,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:25,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:25,432 INFO L87 Difference]: Start difference. First operand 349 states and 520 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-21 10:23:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:25,962 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2021-12-21 10:23:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-12-21 10:23:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:25,963 INFO L225 Difference]: With dead ends: 710 [2021-12-21 10:23:25,964 INFO L226 Difference]: Without dead ends: 382 [2021-12-21 10:23:25,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:25,964 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 68 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:25,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 495 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 10:23:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-21 10:23:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 349. [2021-12-21 10:23:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4913793103448276) internal successors, (519), 348 states have internal predecessors, (519), 0 states have call successors, (0), 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-12-21 10:23:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions. [2021-12-21 10:23:25,970 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 105 [2021-12-21 10:23:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:25,971 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions. [2021-12-21 10:23:25,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-21 10:23:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions. [2021-12-21 10:23:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 10:23:25,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:25,972 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-21 10:23:25,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 10:23:25,972 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -213108826, now seen corresponding path program 1 times [2021-12-21 10:23:25,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717768240] [2021-12-21 10:23:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:25,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:26,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:26,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717768240] [2021-12-21 10:23:26,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717768240] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:26,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:26,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:26,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346678507] [2021-12-21 10:23:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:26,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:26,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:26,050 INFO L87 Difference]: Start difference. First operand 349 states and 519 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-21 10:23:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:26,663 INFO L93 Difference]: Finished difference Result 707 states and 1053 transitions. [2021-12-21 10:23:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-12-21 10:23:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:26,665 INFO L225 Difference]: With dead ends: 707 [2021-12-21 10:23:26,665 INFO L226 Difference]: Without dead ends: 379 [2021-12-21 10:23:26,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:26,666 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:26,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-12-21 10:23:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349. [2021-12-21 10:23:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4885057471264367) internal successors, (518), 348 states have internal predecessors, (518), 0 states have call successors, (0), 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-12-21 10:23:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 518 transitions. [2021-12-21 10:23:26,673 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 518 transitions. Word has length 105 [2021-12-21 10:23:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:26,673 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 518 transitions. [2021-12-21 10:23:26,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-12-21 10:23:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 518 transitions. [2021-12-21 10:23:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 10:23:26,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:26,674 INFO L514 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-12-21 10:23:26,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 10:23:26,675 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1295545029, now seen corresponding path program 1 times [2021-12-21 10:23:26,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:26,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547146442] [2021-12-21 10:23:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:26,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:26,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547146442] [2021-12-21 10:23:26,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547146442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:26,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:26,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:23:26,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821827672] [2021-12-21 10:23:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:26,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:23:26,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:23:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:23:26,752 INFO L87 Difference]: Start difference. First operand 349 states and 518 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-12-21 10:23:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,183 INFO L93 Difference]: Finished difference Result 755 states and 1129 transitions. [2021-12-21 10:23:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:23:27,183 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-12-21 10:23:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,184 INFO L225 Difference]: With dead ends: 755 [2021-12-21 10:23:27,184 INFO L226 Difference]: Without dead ends: 427 [2021-12-21 10:23:27,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:27,185 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 10:23:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-12-21 10:23:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2021-12-21 10:23:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 348 states have internal predecessors, (514), 0 states have call successors, (0), 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-12-21 10:23:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 514 transitions. [2021-12-21 10:23:27,190 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 514 transitions. Word has length 106 [2021-12-21 10:23:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,191 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 514 transitions. [2021-12-21 10:23:27,191 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-12-21 10:23:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 514 transitions. [2021-12-21 10:23:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 10:23:27,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,192 INFO L514 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-12-21 10:23:27,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 10:23:27,192 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash 878148423, now seen corresponding path program 1 times [2021-12-21 10:23:27,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678898596] [2021-12-21 10:23:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 10:23:27,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678898596] [2021-12-21 10:23:27,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678898596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:27,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:27,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:27,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090679082] [2021-12-21 10:23:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:27,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:27,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,296 INFO L87 Difference]: Start difference. First operand 349 states and 514 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-12-21 10:23:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,329 INFO L93 Difference]: Finished difference Result 1000 states and 1488 transitions. [2021-12-21 10:23:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:27,329 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-12-21 10:23:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,331 INFO L225 Difference]: With dead ends: 1000 [2021-12-21 10:23:27,331 INFO L226 Difference]: Without dead ends: 672 [2021-12-21 10:23:27,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,335 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-12-21 10:23:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2021-12-21 10:23:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.473919523099851) internal successors, (989), 671 states have internal predecessors, (989), 0 states have call successors, (0), 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-12-21 10:23:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 989 transitions. [2021-12-21 10:23:27,351 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 989 transitions. Word has length 106 [2021-12-21 10:23:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,351 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 989 transitions. [2021-12-21 10:23:27,351 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-12-21 10:23:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 989 transitions. [2021-12-21 10:23:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 10:23:27,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,353 INFO L514 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-12-21 10:23:27,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 10:23:27,353 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -808031415, now seen corresponding path program 1 times [2021-12-21 10:23:27,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557520661] [2021-12-21 10:23:27,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 10:23:27,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:27,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557520661] [2021-12-21 10:23:27,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557520661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:27,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:27,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:27,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052482407] [2021-12-21 10:23:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:27,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:27,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:27,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:27,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,426 INFO L87 Difference]: Start difference. First operand 672 states and 989 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-12-21 10:23:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,450 INFO L93 Difference]: Finished difference Result 1350 states and 1990 transitions. [2021-12-21 10:23:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 106 [2021-12-21 10:23:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,452 INFO L225 Difference]: With dead ends: 1350 [2021-12-21 10:23:27,452 INFO L226 Difference]: Without dead ends: 699 [2021-12-21 10:23:27,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,454 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-12-21 10:23:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-12-21 10:23:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4670487106017192) internal successors, (1024), 698 states have internal predecessors, (1024), 0 states have call successors, (0), 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-12-21 10:23:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1024 transitions. [2021-12-21 10:23:27,466 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1024 transitions. Word has length 106 [2021-12-21 10:23:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,466 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 1024 transitions. [2021-12-21 10:23:27,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-12-21 10:23:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1024 transitions. [2021-12-21 10:23:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 10:23:27,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,468 INFO L514 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-12-21 10:23:27,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 10:23:27,468 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1068451403, now seen corresponding path program 1 times [2021-12-21 10:23:27,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615646309] [2021-12-21 10:23:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-12-21 10:23:27,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615646309] [2021-12-21 10:23:27,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615646309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:27,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:27,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:27,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66992938] [2021-12-21 10:23:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:27,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:27,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,530 INFO L87 Difference]: Start difference. First operand 699 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,549 INFO L93 Difference]: Finished difference Result 1379 states and 2026 transitions. [2021-12-21 10:23:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-12-21 10:23:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,551 INFO L225 Difference]: With dead ends: 1379 [2021-12-21 10:23:27,551 INFO L226 Difference]: Without dead ends: 701 [2021-12-21 10:23:27,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,553 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-12-21 10:23:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2021-12-21 10:23:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.4657142857142857) internal successors, (1026), 700 states have internal predecessors, (1026), 0 states have call successors, (0), 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-12-21 10:23:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1026 transitions. [2021-12-21 10:23:27,565 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1026 transitions. Word has length 106 [2021-12-21 10:23:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,565 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1026 transitions. [2021-12-21 10:23:27,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1026 transitions. [2021-12-21 10:23:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 10:23:27,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,567 INFO L514 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, 1] [2021-12-21 10:23:27,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-21 10:23:27,567 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -414944271, now seen corresponding path program 1 times [2021-12-21 10:23:27,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823001046] [2021-12-21 10:23:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-21 10:23:27,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:27,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823001046] [2021-12-21 10:23:27,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823001046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:27,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:27,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:27,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396974742] [2021-12-21 10:23:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:27,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:27,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,682 INFO L87 Difference]: Start difference. First operand 701 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-21 10:23:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,722 INFO L93 Difference]: Finished difference Result 1707 states and 2514 transitions. [2021-12-21 10:23:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:27,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 [2021-12-21 10:23:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,726 INFO L225 Difference]: With dead ends: 1707 [2021-12-21 10:23:27,726 INFO L226 Difference]: Without dead ends: 1029 [2021-12-21 10:23:27,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,727 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-12-21 10:23:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1027. [2021-12-21 10:23:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4688109161793372) internal successors, (1507), 1026 states have internal predecessors, (1507), 0 states have call successors, (0), 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-12-21 10:23:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1507 transitions. [2021-12-21 10:23:27,744 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1507 transitions. Word has length 108 [2021-12-21 10:23:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,744 INFO L470 AbstractCegarLoop]: Abstraction has 1027 states and 1507 transitions. [2021-12-21 10:23:27,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-21 10:23:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1507 transitions. [2021-12-21 10:23:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-21 10:23:27,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,746 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 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-12-21 10:23:27,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-21 10:23:27,746 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2063160218, now seen corresponding path program 1 times [2021-12-21 10:23:27,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229499097] [2021-12-21 10:23:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-21 10:23:27,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:27,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229499097] [2021-12-21 10:23:27,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229499097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:27,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:27,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:27,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669964071] [2021-12-21 10:23:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:27,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:27,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,826 INFO L87 Difference]: Start difference. First operand 1027 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-21 10:23:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:27,868 INFO L93 Difference]: Finished difference Result 2353 states and 3470 transitions. [2021-12-21 10:23:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 125 [2021-12-21 10:23:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:27,872 INFO L225 Difference]: With dead ends: 2353 [2021-12-21 10:23:27,872 INFO L226 Difference]: Without dead ends: 1349 [2021-12-21 10:23:27,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:27,877 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:27,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2021-12-21 10:23:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2021-12-21 10:23:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4688427299703264) internal successors, (1980), 1348 states have internal predecessors, (1980), 0 states have call successors, (0), 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-12-21 10:23:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1980 transitions. [2021-12-21 10:23:27,897 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1980 transitions. Word has length 125 [2021-12-21 10:23:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:27,898 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 1980 transitions. [2021-12-21 10:23:27,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-12-21 10:23:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1980 transitions. [2021-12-21 10:23:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-21 10:23:27,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:27,900 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:23:27,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-21 10:23:27,900 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 726227607, now seen corresponding path program 1 times [2021-12-21 10:23:27,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:27,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647890684] [2021-12-21 10:23:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:27,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-21 10:23:28,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:28,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647890684] [2021-12-21 10:23:28,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647890684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:28,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:28,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:28,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969106201] [2021-12-21 10:23:28,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:28,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:28,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:28,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:28,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:28,050 INFO L87 Difference]: Start difference. First operand 1349 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-21 10:23:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:28,087 INFO L93 Difference]: Finished difference Result 2005 states and 2944 transitions. [2021-12-21 10:23:28,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:28,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 128 [2021-12-21 10:23:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:28,091 INFO L225 Difference]: With dead ends: 2005 [2021-12-21 10:23:28,092 INFO L226 Difference]: Without dead ends: 1677 [2021-12-21 10:23:28,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:28,093 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:28,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:23:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2021-12-21 10:23:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1675. [2021-12-21 10:23:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.467741935483871) internal successors, (2457), 1674 states have internal predecessors, (2457), 0 states have call successors, (0), 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-12-21 10:23:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2457 transitions. [2021-12-21 10:23:28,130 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2457 transitions. Word has length 128 [2021-12-21 10:23:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:28,130 INFO L470 AbstractCegarLoop]: Abstraction has 1675 states and 2457 transitions. [2021-12-21 10:23:28,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-21 10:23:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2457 transitions. [2021-12-21 10:23:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-21 10:23:28,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:28,133 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:23:28,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-21 10:23:28,133 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2021-12-21 10:23:28,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:28,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333418172] [2021-12-21 10:23:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:28,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-21 10:23:28,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:23:28,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333418172] [2021-12-21 10:23:28,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333418172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:28,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:28,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 10:23:28,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530881487] [2021-12-21 10:23:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:28,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 10:23:28,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:23:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 10:23:28,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:28,362 INFO L87 Difference]: Start difference. First operand 1675 states and 2457 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:29,972 INFO L93 Difference]: Finished difference Result 3347 states and 4910 transitions. [2021-12-21 10:23:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 10:23:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-12-21 10:23:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:29,982 INFO L225 Difference]: With dead ends: 3347 [2021-12-21 10:23:29,982 INFO L226 Difference]: Without dead ends: 1675 [2021-12-21 10:23:29,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 10:23:29,984 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:29,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-21 10:23:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2021-12-21 10:23:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2021-12-21 10:23:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.4671445639187575) internal successors, (2456), 1674 states have internal predecessors, (2456), 0 states have call successors, (0), 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-12-21 10:23:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2456 transitions. [2021-12-21 10:23:30,015 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2456 transitions. Word has length 129 [2021-12-21 10:23:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:30,015 INFO L470 AbstractCegarLoop]: Abstraction has 1675 states and 2456 transitions. [2021-12-21 10:23:30,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2456 transitions. [2021-12-21 10:23:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-21 10:23:30,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:30,017 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:23:30,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-21 10:23:30,018 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2021-12-21 10:23:30,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:23:30,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591075253] [2021-12-21 10:23:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:30,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:23:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 10:23:30,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 10:23:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 10:23:30,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 10:23:30,640 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 10:23:30,641 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 10:23:30,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-21 10:23:30,645 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-21 10:23:30,647 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 10:23:30,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:23:30 BoogieIcfgContainer [2021-12-21 10:23:30,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 10:23:30,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 10:23:30,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 10:23:30,759 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 10:23:30,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:23:07" (3/4) ... [2021-12-21 10:23:30,762 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 10:23:30,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 10:23:30,762 INFO L158 Benchmark]: Toolchain (without parser) took 26285.40ms. Allocated memory was 111.1MB in the beginning and 285.2MB in the end (delta: 174.1MB). Free memory was 83.2MB in the beginning and 129.5MB in the end (delta: -46.3MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,762 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 10:23:30,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.94ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 66.7MB in the end (delta: 16.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.32ms. Allocated memory is still 111.1MB. Free memory was 66.7MB in the beginning and 61.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,764 INFO L158 Benchmark]: Boogie Preprocessor took 46.70ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 54.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,765 INFO L158 Benchmark]: RCFGBuilder took 2207.85ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 54.6MB in the beginning and 85.5MB in the end (delta: -30.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,768 INFO L158 Benchmark]: TraceAbstraction took 23553.85ms. Allocated memory was 134.2MB in the beginning and 285.2MB in the end (delta: 151.0MB). Free memory was 85.0MB in the beginning and 129.5MB in the end (delta: -44.5MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2021-12-21 10:23:30,768 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 285.2MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 10:23:30,770 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.18ms. Allocated memory is still 111.1MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.94ms. Allocated memory is still 111.1MB. Free memory was 82.8MB in the beginning and 66.7MB in the end (delta: 16.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.32ms. Allocated memory is still 111.1MB. Free memory was 66.7MB in the beginning and 61.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.70ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 54.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2207.85ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 54.6MB in the beginning and 85.5MB in the end (delta: -30.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23553.85ms. Allocated memory was 134.2MB in the beginning and 285.2MB in the end (delta: 151.0MB). Free memory was 85.0MB in the beginning and 129.5MB in the end (delta: -44.5MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 285.2MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: 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 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] EXPR s->cert VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:5}, blastFlag=1, got_new_session=0, init=1, ret=10, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1388] s->init_num = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967311, (s->s3)->tmp.new_cipher={-4294967300:0}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->options=4294967317, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:5}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967325, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->verify_mode=7, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:5}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->session={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967311, (s->s3)->tmp.new_cipher={-4294967300:0}, blastFlag=7, got_new_session=1, init=1, l=15, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=0, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1757] reach_error() VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=15, ret=0, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 13512 SdHoareTripleChecker+Invalid, 17.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7878 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5592 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 5634 mSDtfsCounter, 5592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1675occurred in iteration=30, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 6359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 1458/1458 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-12-21 10:23:30,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.11.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:23:32,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:23:32,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:23:32,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:23:32,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:23:32,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:23:32,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:23:32,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:23:32,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:23:32,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:23:32,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:23:32,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:23:32,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:23:32,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:23:32,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:23:32,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:23:32,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:23:32,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:23:32,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:23:32,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:23:32,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:23:32,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:23:32,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:23:32,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:23:32,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:23:32,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:23:32,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:23:32,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:23:32,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:23:32,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:23:32,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:23:32,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:23:32,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:23:32,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:23:32,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:23:32,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:23:32,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:23:32,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:23:32,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:23:32,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:23:32,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:23:32,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-21 10:23:32,681 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:23:32,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:23:32,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:23:32,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:23:32,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:23:32,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:23:32,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:23:32,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:23:32,684 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:23:32,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:23:32,685 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:23:32,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:23:32,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:23:32,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:23:32,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:23:32,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:23:32,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:23:32,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 10:23:32,688 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2021-12-21 10:23:32,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:23:32,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:23:32,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:23:32,987 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:23:32,987 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:23:32,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:33,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9d63cd6/0f97b2a3260a47c2bd1ac7537ec72080/FLAG57e1b4cc3 [2021-12-21 10:23:33,524 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:23:33,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:33,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9d63cd6/0f97b2a3260a47c2bd1ac7537ec72080/FLAG57e1b4cc3 [2021-12-21 10:23:33,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9d63cd6/0f97b2a3260a47c2bd1ac7537ec72080 [2021-12-21 10:23:33,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:23:33,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:23:33,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:23:33,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:23:33,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:23:33,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:33" (1/1) ... [2021-12-21 10:23:33,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc05c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:33, skipping insertion in model container [2021-12-21 10:23:33,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:33" (1/1) ... [2021-12-21 10:23:33,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:23:33,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:23:33,937 WARN L230 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.11.i.cil-1.c[74369,74382] [2021-12-21 10:23:33,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:23:33,959 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-21 10:23:33,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:23:34,054 WARN L230 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.11.i.cil-1.c[74369,74382] [2021-12-21 10:23:34,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:23:34,075 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:23:34,169 WARN L230 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.11.i.cil-1.c[74369,74382] [2021-12-21 10:23:34,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:23:34,187 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:23:34,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34 WrapperNode [2021-12-21 10:23:34,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:23:34,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:23:34,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:23:34,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:23:34,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,275 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2021-12-21 10:23:34,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:23:34,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:23:34,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:23:34,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:23:34,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:23:34,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:23:34,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:23:34,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:23:34,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (1/1) ... [2021-12-21 10:23:34,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:23:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:23:34,407 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-12-21 10:23:34,411 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-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:23:34,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:23:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 10:23:34,612 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:23:34,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:23:34,641 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 10:23:41,477 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-21 10:23:41,477 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-21 10:23:41,477 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:23:41,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:23:41,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 10:23:41,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:23:41 BoogieIcfgContainer [2021-12-21 10:23:41,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:23:41,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:23:41,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:23:41,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:23:41,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:23:33" (1/3) ... [2021-12-21 10:23:41,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540ef46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:23:41, skipping insertion in model container [2021-12-21 10:23:41,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:34" (2/3) ... [2021-12-21 10:23:41,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540ef46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:23:41, skipping insertion in model container [2021-12-21 10:23:41,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:23:41" (3/3) ... [2021-12-21 10:23:41,490 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-12-21 10:23:41,494 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:23:41,494 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:23:41,533 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:23:41,539 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-21 10:23:41,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:23:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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-12-21 10:23:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:23:41,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:41,562 INFO L514 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] [2021-12-21 10:23:41,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-12-21 10:23:41,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808266828] [2021-12-21 10:23:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:41,580 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:41,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:41,603 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-12-21 10:23:41,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 10:23:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:42,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 10:23:42,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:42,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:42,231 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:42,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808266828] [2021-12-21 10:23:42,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808266828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:42,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:42,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:42,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200642917] [2021-12-21 10:23:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:42,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:42,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:42,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:42,265 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:42,388 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2021-12-21 10:23:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:42,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:23:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:42,404 INFO L225 Difference]: With dead ends: 427 [2021-12-21 10:23:42,404 INFO L226 Difference]: Without dead ends: 261 [2021-12-21 10:23:42,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:42,410 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:42,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:23:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-21 10:23:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2021-12-21 10:23:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 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-12-21 10:23:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2021-12-21 10:23:42,444 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2021-12-21 10:23:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:42,444 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2021-12-21 10:23:42,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2021-12-21 10:23:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-21 10:23:42,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:42,446 INFO L514 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] [2021-12-21 10:23:42,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-21 10:23:42,647 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-12-21 10:23:42,647 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2021-12-21 10:23:42,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:42,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562946199] [2021-12-21 10:23:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:42,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:42,650 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-12-21 10:23:42,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 10:23:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:43,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 10:23:43,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:23:43,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:43,294 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562946199] [2021-12-21 10:23:43,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562946199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:43,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:43,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:43,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325466842] [2021-12-21 10:23:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:43,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:43,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:43,296 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-21 10:23:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:43,898 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2021-12-21 10:23:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:43,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-12-21 10:23:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:43,901 INFO L225 Difference]: With dead ends: 510 [2021-12-21 10:23:43,901 INFO L226 Difference]: Without dead ends: 383 [2021-12-21 10:23:43,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:43,902 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:43,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-12-21 10:23:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2021-12-21 10:23:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 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-12-21 10:23:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2021-12-21 10:23:43,914 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2021-12-21 10:23:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:43,914 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2021-12-21 10:23:43,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-21 10:23:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2021-12-21 10:23:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-21 10:23:43,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:43,917 INFO L514 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] [2021-12-21 10:23:43,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 10:23:44,136 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-12-21 10:23:44,137 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2021-12-21 10:23:44,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:44,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730512861] [2021-12-21 10:23:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:44,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:44,149 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-12-21 10:23:44,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 10:23:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:44,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 10:23:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 10:23:44,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:44,769 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730512861] [2021-12-21 10:23:44,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730512861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:44,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:44,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:44,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433938957] [2021-12-21 10:23:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:44,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:44,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:44,770 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-21 10:23:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:45,214 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2021-12-21 10:23:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-21 10:23:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:45,217 INFO L225 Difference]: With dead ends: 754 [2021-12-21 10:23:45,217 INFO L226 Difference]: Without dead ends: 505 [2021-12-21 10:23:45,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:45,218 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:45,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 10:23:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-21 10:23:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2021-12-21 10:23:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 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-12-21 10:23:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2021-12-21 10:23:45,237 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2021-12-21 10:23:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:45,239 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2021-12-21 10:23:45,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-21 10:23:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2021-12-21 10:23:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-21 10:23:45,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:45,246 INFO L514 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] [2021-12-21 10:23:45,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 10:23:45,460 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-12-21 10:23:45,460 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1458485308, now seen corresponding path program 1 times [2021-12-21 10:23:45,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:45,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977036999] [2021-12-21 10:23:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:45,461 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:45,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 10:23:45,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 10:23:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:45,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 10:23:46,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-21 10:23:46,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:46,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:46,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977036999] [2021-12-21 10:23:46,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977036999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:46,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:46,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:46,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774951304] [2021-12-21 10:23:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:46,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:46,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:46,174 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:46,595 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2021-12-21 10:23:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-12-21 10:23:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:46,598 INFO L225 Difference]: With dead ends: 1000 [2021-12-21 10:23:46,598 INFO L226 Difference]: Without dead ends: 629 [2021-12-21 10:23:46,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:46,599 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:46,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 10:23:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-12-21 10:23:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2021-12-21 10:23:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 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-12-21 10:23:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2021-12-21 10:23:46,618 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2021-12-21 10:23:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:46,618 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2021-12-21 10:23:46,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2021-12-21 10:23:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-21 10:23:46,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:46,620 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-21 10:23:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 10:23:46,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 10:23:46,826 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1045011737, now seen corresponding path program 1 times [2021-12-21 10:23:46,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:46,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355733004] [2021-12-21 10:23:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:46,838 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:46,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 10:23:46,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-21 10:23:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:47,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 10:23:47,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-21 10:23:47,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:47,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:47,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355733004] [2021-12-21 10:23:47,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355733004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:47,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:47,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:23:47,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913555538] [2021-12-21 10:23:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:47,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:23:47,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:23:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:47,558 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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-12-21 10:23:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:23:48,142 INFO L93 Difference]: Finished difference Result 1246 states and 1875 transitions. [2021-12-21 10:23:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:23:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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 117 [2021-12-21 10:23:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:23:48,145 INFO L225 Difference]: With dead ends: 1246 [2021-12-21 10:23:48,145 INFO L226 Difference]: Without dead ends: 751 [2021-12-21 10:23:48,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:23:48,146 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 10:23:48,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 10:23:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-12-21 10:23:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2021-12-21 10:23:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.496) internal successors, (1122), 750 states have internal predecessors, (1122), 0 states have call successors, (0), 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-12-21 10:23:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1122 transitions. [2021-12-21 10:23:48,160 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1122 transitions. Word has length 117 [2021-12-21 10:23:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:23:48,161 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 1122 transitions. [2021-12-21 10:23:48,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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-12-21 10:23:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1122 transitions. [2021-12-21 10:23:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-21 10:23:48,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:23:48,163 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:23:48,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-21 10:23:48,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 10:23:48,379 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:23:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:23:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2021-12-21 10:23:48,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:23:48,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801523492] [2021-12-21 10:23:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:23:48,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:23:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:23:48,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 10:23:48,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 10:23:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:23:49,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 10:23:49,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:23:49,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:23:49,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:23:50,345 INFO L353 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2021-12-21 10:23:50,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2021-12-21 10:23:50,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2021-12-21 10:23:50,612 INFO L353 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2021-12-21 10:23:50,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2021-12-21 10:23:50,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:23:50,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2021-12-21 10:23:50,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 10:23:50,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 10:23:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-21 10:23:50,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 10:23:50,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 10:23:50,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801523492] [2021-12-21 10:23:50,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801523492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:23:50,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:23:50,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 10:23:50,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400425076] [2021-12-21 10:23:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:23:50,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 10:23:50,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 10:23:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 10:23:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 10:23:50,881 INFO L87 Difference]: Start difference. First operand 751 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:23:52,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 10:23:54,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 10:24:02,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 10:24:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:24:03,802 INFO L93 Difference]: Finished difference Result 1499 states and 2240 transitions. [2021-12-21 10:24:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 10:24:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2021-12-21 10:24:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:24:03,807 INFO L225 Difference]: With dead ends: 1499 [2021-12-21 10:24:03,807 INFO L226 Difference]: Without dead ends: 751 [2021-12-21 10:24:03,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 10:24:03,808 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2021-12-21 10:24:03,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2021-12-21 10:24:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-12-21 10:24:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2021-12-21 10:24:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4946666666666666) internal successors, (1121), 750 states have internal predecessors, (1121), 0 states have call successors, (0), 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-12-21 10:24:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1121 transitions. [2021-12-21 10:24:03,823 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1121 transitions. Word has length 129 [2021-12-21 10:24:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:24:03,823 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 1121 transitions. [2021-12-21 10:24:03,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:24:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1121 transitions. [2021-12-21 10:24:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-21 10:24:03,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:24:03,824 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:24:03,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-21 10:24:04,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 10:24:04,051 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:24:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:24:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2021-12-21 10:24:04,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 10:24:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93854647] [2021-12-21 10:24:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:24:04,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 10:24:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 10:24:04,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 10:24:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 10:24:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:24:05,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 10:24:05,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:24:05,443 INFO L353 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2021-12-21 10:24:05,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2021-12-21 10:24:05,572 INFO L353 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2021-12-21 10:24:05,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2021-12-21 10:24:05,659 INFO L353 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-12-21 10:24:05,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15