./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77ee66abd2a03836cba1056e8b8f081ca3f237e1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.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 77ee66abd2a03836cba1056e8b8f081ca3f237e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:21:09,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:21:09,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:21:09,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:21:09,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:21:09,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:21:09,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:21:09,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:21:09,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:21:09,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:21:09,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:21:09,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:21:09,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:21:09,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:21:09,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:21:09,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:21:09,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:21:09,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:21:09,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:21:09,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:21:09,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:21:09,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:21:09,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:21:09,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:21:09,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:21:09,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:21:09,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:21:09,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:21:09,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:21:09,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:21:09,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:21:09,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:21:09,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:21:09,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:21:09,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:21:09,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:21:09,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:21:09,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:21:09,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:21:09,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:21:09,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:21:09,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:21:09,296 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:21:09,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:21:09,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:21:09,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:21:09,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:21:09,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:21:09,299 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:21:09,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:21:09,299 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:21:09,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:21:09,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:21:09,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:21:09,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:21:09,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:21:09,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:21:09,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:21:09,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:09,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:21:09,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:21:09,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:21:09,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:21:09,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:21:09,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:21:09,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:21:09,303 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 -> 77ee66abd2a03836cba1056e8b8f081ca3f237e1 [2021-08-25 20:21:09,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:21:09,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:21:09,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:21:09,601 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:21:09,601 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:21:09,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:09,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd5d4234/1d103f68da9c4159bbbb12eea072ea4e/FLAG7ab7da6c7 [2021-08-25 20:21:10,106 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:21:10,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:10,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd5d4234/1d103f68da9c4159bbbb12eea072ea4e/FLAG7ab7da6c7 [2021-08-25 20:21:10,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd5d4234/1d103f68da9c4159bbbb12eea072ea4e [2021-08-25 20:21:10,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:21:10,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:21:10,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:10,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:21:10,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:21:10,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:10,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5033f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10, skipping insertion in model container [2021-08-25 20:21:10,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:10,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:21:10,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:21:10,793 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] [2021-08-25 20:21:10,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:10,815 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:21:10,918 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] [2021-08-25 20:21:10,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:10,936 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:21:10,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10 WrapperNode [2021-08-25 20:21:10,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:10,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:10,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:21:10,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:21:10,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:10,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:11,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:21:11,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:21:11,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:21:11,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:21:11,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:21:11,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:21:11,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:21:11,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (1/1) ... [2021-08-25 20:21:11,137 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:11,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:21:11,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:21:11,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:21:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:21:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:21:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:21:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:21:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:21:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:21:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:21:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:21:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:21:11,342 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:21:11,793 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:21:11,793 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:21:11,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:21:11,802 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:21:11,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:11 BoogieIcfgContainer [2021-08-25 20:21:11,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:21:11,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:21:11,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:21:11,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:21:11,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:21:10" (1/3) ... [2021-08-25 20:21:11,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ec911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:11, skipping insertion in model container [2021-08-25 20:21:11,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:10" (2/3) ... [2021-08-25 20:21:11,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ec911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:11, skipping insertion in model container [2021-08-25 20:21:11,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:11" (3/3) ... [2021-08-25 20:21:11,809 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:11,814 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:21:11,814 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:21:11,850 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:21:11,855 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:21:11,855 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:21:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 144 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:21:11,873 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:11,873 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:11,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2021-08-25 20:21:11,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:11,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512349926] [2021-08-25 20:21:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:11,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:12,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:12,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512349926] [2021-08-25 20:21:12,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512349926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:12,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:12,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:12,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90958915] [2021-08-25 20:21:12,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:12,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:12,078 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 144 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:12,357 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2021-08-25 20:21:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:21:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:12,364 INFO L225 Difference]: With dead ends: 317 [2021-08-25 20:21:12,365 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:21:12,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:21:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-25 20:21:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-08-25 20:21:12,393 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2021-08-25 20:21:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:12,394 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-08-25 20:21:12,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-08-25 20:21:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:21:12,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:12,396 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:12,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:21:12,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2021-08-25 20:21:12,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:12,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759163344] [2021-08-25 20:21:12,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:12,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:12,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:12,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759163344] [2021-08-25 20:21:12,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759163344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:12,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:12,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:12,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713705852] [2021-08-25 20:21:12,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:12,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:12,480 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:12,688 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2021-08-25 20:21:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-08-25 20:21:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:12,689 INFO L225 Difference]: With dead ends: 284 [2021-08-25 20:21:12,689 INFO L226 Difference]: Without dead ends: 160 [2021-08-25 20:21:12,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-25 20:21:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-25 20:21:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-08-25 20:21:12,696 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2021-08-25 20:21:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:12,696 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-08-25 20:21:12,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-08-25 20:21:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:12,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:12,697 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:12,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:21:12,698 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2021-08-25 20:21:12,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:12,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130467401] [2021-08-25 20:21:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:12,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:12,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:12,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130467401] [2021-08-25 20:21:12,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130467401] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:12,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:12,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:12,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592299321] [2021-08-25 20:21:12,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:12,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:12,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:12,762 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:12,970 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2021-08-25 20:21:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:12,972 INFO L225 Difference]: With dead ends: 282 [2021-08-25 20:21:12,972 INFO L226 Difference]: Without dead ends: 158 [2021-08-25 20:21:12,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-25 20:21:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-08-25 20:21:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-08-25 20:21:12,978 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2021-08-25 20:21:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:12,978 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-08-25 20:21:12,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-08-25 20:21:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-25 20:21:12,979 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:12,979 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:12,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:21:12,980 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2021-08-25 20:21:12,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:12,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554396954] [2021-08-25 20:21:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:12,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:13,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:13,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554396954] [2021-08-25 20:21:13,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554396954] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:13,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:13,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:13,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900250545] [2021-08-25 20:21:13,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:13,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:13,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:13,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:13,033 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:13,236 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2021-08-25 20:21:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-25 20:21:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:13,237 INFO L225 Difference]: With dead ends: 281 [2021-08-25 20:21:13,237 INFO L226 Difference]: Without dead ends: 157 [2021-08-25 20:21:13,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-25 20:21:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-08-25 20:21:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 142 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-08-25 20:21:13,242 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2021-08-25 20:21:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:13,243 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-08-25 20:21:13,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-08-25 20:21:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:21:13,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:13,244 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:13,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:21:13,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2021-08-25 20:21:13,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:13,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277719130] [2021-08-25 20:21:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:13,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:13,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:13,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277719130] [2021-08-25 20:21:13,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277719130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:13,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:13,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:13,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717596007] [2021-08-25 20:21:13,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:13,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:13,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:13,301 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:13,493 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2021-08-25 20:21:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-25 20:21:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:13,494 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:21:13,495 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:21:13,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:21:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:21:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-08-25 20:21:13,499 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2021-08-25 20:21:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:13,499 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-08-25 20:21:13,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-08-25 20:21:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:21:13,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:13,500 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:13,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:21:13,500 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2021-08-25 20:21:13,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:13,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042075013] [2021-08-25 20:21:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:13,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:13,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:13,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042075013] [2021-08-25 20:21:13,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042075013] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:13,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:13,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:13,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733822351] [2021-08-25 20:21:13,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:13,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:13,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:13,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:13,541 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:13,739 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-08-25 20:21:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-25 20:21:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:13,741 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:21:13,741 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:21:13,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:21:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:21:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-08-25 20:21:13,744 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2021-08-25 20:21:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:13,745 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-08-25 20:21:13,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-08-25 20:21:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-25 20:21:13,745 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:13,745 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:13,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:21:13,746 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2021-08-25 20:21:13,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:13,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021760614] [2021-08-25 20:21:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:13,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:13,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:13,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021760614] [2021-08-25 20:21:13,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021760614] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:13,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:13,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:13,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307276446] [2021-08-25 20:21:13,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:13,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:13,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:13,785 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:13,978 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2021-08-25 20:21:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-25 20:21:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:13,979 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:21:13,979 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:21:13,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:21:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:21:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-08-25 20:21:13,983 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2021-08-25 20:21:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:13,983 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-08-25 20:21:13,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-08-25 20:21:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:21:13,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:13,983 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:13,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:21:13,984 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2021-08-25 20:21:13,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:13,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189085520] [2021-08-25 20:21:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:13,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:14,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:14,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189085520] [2021-08-25 20:21:14,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189085520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:14,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:14,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:14,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432878861] [2021-08-25 20:21:14,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:14,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:14,036 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:14,225 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2021-08-25 20:21:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-25 20:21:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:14,226 INFO L225 Difference]: With dead ends: 280 [2021-08-25 20:21:14,226 INFO L226 Difference]: Without dead ends: 156 [2021-08-25 20:21:14,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-25 20:21:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-08-25 20:21:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 142 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-08-25 20:21:14,229 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2021-08-25 20:21:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:14,229 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-08-25 20:21:14,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-08-25 20:21:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-25 20:21:14,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:14,230 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:14,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:21:14,230 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2021-08-25 20:21:14,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:14,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762052622] [2021-08-25 20:21:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:14,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:14,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:14,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762052622] [2021-08-25 20:21:14,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762052622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:14,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:14,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:14,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931184275] [2021-08-25 20:21:14,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:14,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:14,264 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:14,490 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2021-08-25 20:21:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-25 20:21:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:14,492 INFO L225 Difference]: With dead ends: 310 [2021-08-25 20:21:14,492 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:21:14,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:21:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-08-25 20:21:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.524390243902439) internal successors, (250), 164 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2021-08-25 20:21:14,495 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2021-08-25 20:21:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:14,496 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2021-08-25 20:21:14,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2021-08-25 20:21:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-25 20:21:14,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:14,496 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:14,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:21:14,497 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2021-08-25 20:21:14,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:14,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170713470] [2021-08-25 20:21:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:14,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:14,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:14,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170713470] [2021-08-25 20:21:14,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170713470] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:14,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:14,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:14,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959293681] [2021-08-25 20:21:14,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:14,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:14,535 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:14,717 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2021-08-25 20:21:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:14,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-25 20:21:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:14,718 INFO L225 Difference]: With dead ends: 314 [2021-08-25 20:21:14,718 INFO L226 Difference]: Without dead ends: 168 [2021-08-25 20:21:14,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-25 20:21:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2021-08-25 20:21:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 164 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-08-25 20:21:14,722 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2021-08-25 20:21:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:14,722 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-08-25 20:21:14,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-08-25 20:21:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:21:14,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:14,722 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:14,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:21:14,723 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2021-08-25 20:21:14,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:14,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144214126] [2021-08-25 20:21:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:14,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:14,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:14,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144214126] [2021-08-25 20:21:14,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144214126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:14,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:14,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:14,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459099784] [2021-08-25 20:21:14,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:14,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:14,756 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:14,982 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2021-08-25 20:21:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:21:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:14,984 INFO L225 Difference]: With dead ends: 332 [2021-08-25 20:21:14,984 INFO L226 Difference]: Without dead ends: 186 [2021-08-25 20:21:14,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-25 20:21:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-08-25 20:21:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-08-25 20:21:14,988 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2021-08-25 20:21:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:14,988 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-08-25 20:21:14,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-08-25 20:21:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:14,989 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:14,989 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:14,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:21:14,989 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2021-08-25 20:21:14,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:14,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13726057] [2021-08-25 20:21:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:14,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:15,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:15,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13726057] [2021-08-25 20:21:15,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13726057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:15,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:15,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:15,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71512413] [2021-08-25 20:21:15,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:15,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:15,065 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:15,247 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2021-08-25 20:21:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:15,249 INFO L225 Difference]: With dead ends: 330 [2021-08-25 20:21:15,249 INFO L226 Difference]: Without dead ends: 184 [2021-08-25 20:21:15,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-25 20:21:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2021-08-25 20:21:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-08-25 20:21:15,253 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2021-08-25 20:21:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:15,253 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-08-25 20:21:15,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-08-25 20:21:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-25 20:21:15,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:15,253 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:15,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:21:15,254 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2021-08-25 20:21:15,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:15,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684545465] [2021-08-25 20:21:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:15,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:15,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:15,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684545465] [2021-08-25 20:21:15,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684545465] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:15,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:15,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:15,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326511409] [2021-08-25 20:21:15,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:15,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:15,338 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:15,562 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2021-08-25 20:21:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-25 20:21:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:15,564 INFO L225 Difference]: With dead ends: 329 [2021-08-25 20:21:15,564 INFO L226 Difference]: Without dead ends: 183 [2021-08-25 20:21:15,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-25 20:21:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-08-25 20:21:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-08-25 20:21:15,568 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2021-08-25 20:21:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:15,569 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-08-25 20:21:15,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-08-25 20:21:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:21:15,570 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:15,570 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:15,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:21:15,570 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2021-08-25 20:21:15,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:15,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484968297] [2021-08-25 20:21:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:15,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:15,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:15,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484968297] [2021-08-25 20:21:15,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484968297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:15,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:15,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:15,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387514544] [2021-08-25 20:21:15,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:15,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:15,607 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:15,779 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2021-08-25 20:21:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-25 20:21:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:15,780 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:21:15,780 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:21:15,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:21:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:21:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 164 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-08-25 20:21:15,783 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2021-08-25 20:21:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:15,783 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-08-25 20:21:15,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-08-25 20:21:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:21:15,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:15,784 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:15,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:21:15,784 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2021-08-25 20:21:15,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:15,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138046607] [2021-08-25 20:21:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:15,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:15,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:15,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138046607] [2021-08-25 20:21:15,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138046607] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:15,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:15,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:15,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476334696] [2021-08-25 20:21:15,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:15,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:15,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:15,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:15,814 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:16,006 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2021-08-25 20:21:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-25 20:21:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:16,007 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:21:16,007 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:21:16,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:21:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:21:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-08-25 20:21:16,010 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2021-08-25 20:21:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:16,010 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-08-25 20:21:16,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-08-25 20:21:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-25 20:21:16,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:16,011 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:16,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:21:16,011 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2021-08-25 20:21:16,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:16,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348239368] [2021-08-25 20:21:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:16,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:16,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:16,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348239368] [2021-08-25 20:21:16,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348239368] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:16,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:16,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:16,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334121857] [2021-08-25 20:21:16,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:16,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:16,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:16,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:16,041 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:16,226 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2021-08-25 20:21:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:16,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-25 20:21:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:16,228 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:21:16,228 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:21:16,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:21:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:21:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 164 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-08-25 20:21:16,231 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2021-08-25 20:21:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:16,231 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-08-25 20:21:16,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-08-25 20:21:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-25 20:21:16,231 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:16,231 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:16,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:21:16,232 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2021-08-25 20:21:16,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:16,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411507844] [2021-08-25 20:21:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:16,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:16,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:16,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411507844] [2021-08-25 20:21:16,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411507844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:16,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:16,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:16,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761941176] [2021-08-25 20:21:16,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:16,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:16,264 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:16,447 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2021-08-25 20:21:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-25 20:21:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:16,448 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:21:16,448 INFO L226 Difference]: Without dead ends: 182 [2021-08-25 20:21:16,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-25 20:21:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-08-25 20:21:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.475609756097561) internal successors, (242), 164 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-08-25 20:21:16,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2021-08-25 20:21:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:16,452 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-08-25 20:21:16,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-08-25 20:21:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:21:16,453 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:16,453 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:16,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:21:16,453 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2021-08-25 20:21:16,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:16,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531369104] [2021-08-25 20:21:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:16,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:16,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:16,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531369104] [2021-08-25 20:21:16,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531369104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:16,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:16,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:16,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118750063] [2021-08-25 20:21:16,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:16,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:16,505 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:16,692 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2021-08-25 20:21:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-08-25 20:21:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:16,694 INFO L225 Difference]: With dead ends: 318 [2021-08-25 20:21:16,694 INFO L226 Difference]: Without dead ends: 172 [2021-08-25 20:21:16,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-25 20:21:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2021-08-25 20:21:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 164 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2021-08-25 20:21:16,698 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2021-08-25 20:21:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:16,699 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2021-08-25 20:21:16,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2021-08-25 20:21:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:21:16,699 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:16,700 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:16,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:21:16,700 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2021-08-25 20:21:16,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:16,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386305073] [2021-08-25 20:21:16,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:16,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:16,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:16,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386305073] [2021-08-25 20:21:16,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386305073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:16,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:16,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:16,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461777064] [2021-08-25 20:21:16,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:16,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:16,746 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:17,028 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2021-08-25 20:21:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:21:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:17,029 INFO L225 Difference]: With dead ends: 408 [2021-08-25 20:21:17,029 INFO L226 Difference]: Without dead ends: 262 [2021-08-25 20:21:17,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-25 20:21:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2021-08-25 20:21:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.541062801932367) internal successors, (319), 207 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2021-08-25 20:21:17,033 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2021-08-25 20:21:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:17,033 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2021-08-25 20:21:17,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2021-08-25 20:21:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:21:17,034 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:17,034 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:17,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:21:17,034 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2021-08-25 20:21:17,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:17,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181241998] [2021-08-25 20:21:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:17,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:17,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:17,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181241998] [2021-08-25 20:21:17,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181241998] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:17,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:17,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:17,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992990586] [2021-08-25 20:21:17,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:17,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:17,070 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:17,302 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2021-08-25 20:21:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:21:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:17,304 INFO L225 Difference]: With dead ends: 446 [2021-08-25 20:21:17,304 INFO L226 Difference]: Without dead ends: 257 [2021-08-25 20:21:17,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-08-25 20:21:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-08-25 20:21:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 231 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2021-08-25 20:21:17,308 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2021-08-25 20:21:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:17,308 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2021-08-25 20:21:17,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2021-08-25 20:21:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:21:17,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:17,309 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:17,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:21:17,309 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2021-08-25 20:21:17,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:17,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096606605] [2021-08-25 20:21:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:17,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:17,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:17,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096606605] [2021-08-25 20:21:17,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096606605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:17,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:17,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:17,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606036729] [2021-08-25 20:21:17,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:17,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:17,346 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:17,646 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2021-08-25 20:21:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:21:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:17,647 INFO L225 Difference]: With dead ends: 499 [2021-08-25 20:21:17,647 INFO L226 Difference]: Without dead ends: 286 [2021-08-25 20:21:17,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-08-25 20:21:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2021-08-25 20:21:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5584415584415585) internal successors, (360), 231 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2021-08-25 20:21:17,651 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2021-08-25 20:21:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:17,651 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2021-08-25 20:21:17,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2021-08-25 20:21:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:21:17,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:17,652 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:17,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:21:17,652 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:17,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2021-08-25 20:21:17,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:17,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344635069] [2021-08-25 20:21:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:17,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:17,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:17,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344635069] [2021-08-25 20:21:17,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344635069] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:17,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:17,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:17,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800893778] [2021-08-25 20:21:17,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:17,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:17,691 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:17,935 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2021-08-25 20:21:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:21:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:17,936 INFO L225 Difference]: With dead ends: 470 [2021-08-25 20:21:17,936 INFO L226 Difference]: Without dead ends: 257 [2021-08-25 20:21:17,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-08-25 20:21:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-08-25 20:21:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5541125541125542) internal successors, (359), 231 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2021-08-25 20:21:17,940 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2021-08-25 20:21:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:17,940 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2021-08-25 20:21:17,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2021-08-25 20:21:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:17,941 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:17,941 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:17,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:21:17,941 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2021-08-25 20:21:17,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:17,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049740798] [2021-08-25 20:21:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:17,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:17,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:17,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049740798] [2021-08-25 20:21:17,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049740798] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:17,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:17,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:17,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985227347] [2021-08-25 20:21:17,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:17,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:17,982 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:18,249 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2021-08-25 20:21:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:18,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:18,250 INFO L225 Difference]: With dead ends: 497 [2021-08-25 20:21:18,250 INFO L226 Difference]: Without dead ends: 284 [2021-08-25 20:21:18,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-08-25 20:21:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2021-08-25 20:21:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2021-08-25 20:21:18,254 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2021-08-25 20:21:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:18,254 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2021-08-25 20:21:18,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2021-08-25 20:21:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:18,255 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:18,255 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:18,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:21:18,255 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2021-08-25 20:21:18,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:18,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872323868] [2021-08-25 20:21:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:18,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:18,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:18,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872323868] [2021-08-25 20:21:18,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872323868] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:18,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:18,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:18,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218029721] [2021-08-25 20:21:18,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:18,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:18,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:18,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:18,292 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:18,549 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2021-08-25 20:21:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:18,550 INFO L225 Difference]: With dead ends: 496 [2021-08-25 20:21:18,550 INFO L226 Difference]: Without dead ends: 283 [2021-08-25 20:21:18,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-08-25 20:21:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2021-08-25 20:21:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 231 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2021-08-25 20:21:18,554 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2021-08-25 20:21:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:18,554 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2021-08-25 20:21:18,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2021-08-25 20:21:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:18,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:18,555 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:18,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:21:18,555 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2021-08-25 20:21:18,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:18,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413951773] [2021-08-25 20:21:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:18,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:18,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:18,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413951773] [2021-08-25 20:21:18,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413951773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:18,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:18,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:18,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40381124] [2021-08-25 20:21:18,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:18,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:18,603 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:18,809 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2021-08-25 20:21:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:18,811 INFO L225 Difference]: With dead ends: 468 [2021-08-25 20:21:18,811 INFO L226 Difference]: Without dead ends: 255 [2021-08-25 20:21:18,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-25 20:21:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2021-08-25 20:21:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 231 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2021-08-25 20:21:18,815 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2021-08-25 20:21:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:18,815 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2021-08-25 20:21:18,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2021-08-25 20:21:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:21:18,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:18,815 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:18,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:21:18,816 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2021-08-25 20:21:18,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:18,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971819230] [2021-08-25 20:21:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:18,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:18,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:18,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971819230] [2021-08-25 20:21:18,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971819230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:18,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:18,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:18,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902555000] [2021-08-25 20:21:18,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:18,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:18,852 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:19,055 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2021-08-25 20:21:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:19,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:21:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:19,056 INFO L225 Difference]: With dead ends: 467 [2021-08-25 20:21:19,056 INFO L226 Difference]: Without dead ends: 254 [2021-08-25 20:21:19,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-25 20:21:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2021-08-25 20:21:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5367965367965368) internal successors, (355), 231 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2021-08-25 20:21:19,060 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2021-08-25 20:21:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:19,060 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2021-08-25 20:21:19,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2021-08-25 20:21:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:21:19,060 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:19,061 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:19,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:21:19,061 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2021-08-25 20:21:19,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:19,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520469555] [2021-08-25 20:21:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:19,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:19,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:19,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520469555] [2021-08-25 20:21:19,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520469555] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:19,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:19,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:19,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053980826] [2021-08-25 20:21:19,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:19,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:19,104 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:19,435 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2021-08-25 20:21:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:21:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:19,437 INFO L225 Difference]: With dead ends: 495 [2021-08-25 20:21:19,437 INFO L226 Difference]: Without dead ends: 282 [2021-08-25 20:21:19,437 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-25 20:21:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2021-08-25 20:21:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5324675324675325) internal successors, (354), 231 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2021-08-25 20:21:19,442 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2021-08-25 20:21:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:19,442 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2021-08-25 20:21:19,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2021-08-25 20:21:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:21:19,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:19,443 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:19,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:21:19,444 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2021-08-25 20:21:19,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:19,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373032267] [2021-08-25 20:21:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:19,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-25 20:21:19,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:19,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373032267] [2021-08-25 20:21:19,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373032267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:19,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:19,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:21:19,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283206616] [2021-08-25 20:21:19,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:21:19,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:21:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:19,504 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:19,837 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2021-08-25 20:21:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:21:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:21:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:19,839 INFO L225 Difference]: With dead ends: 466 [2021-08-25 20:21:19,839 INFO L226 Difference]: Without dead ends: 253 [2021-08-25 20:21:19,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:21:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-25 20:21:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-08-25 20:21:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 251 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2021-08-25 20:21:19,843 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2021-08-25 20:21:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:19,843 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2021-08-25 20:21:19,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2021-08-25 20:21:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:21:19,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:19,845 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:19,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:21:19,845 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2021-08-25 20:21:19,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:19,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611762532] [2021-08-25 20:21:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:19,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:19,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:19,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611762532] [2021-08-25 20:21:19,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611762532] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:19,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:19,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:19,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109476112] [2021-08-25 20:21:19,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:19,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:19,887 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:20,271 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2021-08-25 20:21:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:21:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:20,272 INFO L225 Difference]: With dead ends: 535 [2021-08-25 20:21:20,273 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:21:20,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:21:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-08-25 20:21:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 251 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2021-08-25 20:21:20,278 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2021-08-25 20:21:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:20,279 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2021-08-25 20:21:20,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2021-08-25 20:21:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:21:20,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:20,280 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:20,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:21:20,280 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2021-08-25 20:21:20,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:20,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858867508] [2021-08-25 20:21:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:20,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:20,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:20,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858867508] [2021-08-25 20:21:20,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858867508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:20,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:20,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:20,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552232853] [2021-08-25 20:21:20,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:20,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:20,334 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:20,641 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2021-08-25 20:21:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:21:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:20,642 INFO L225 Difference]: With dead ends: 506 [2021-08-25 20:21:20,642 INFO L226 Difference]: Without dead ends: 273 [2021-08-25 20:21:20,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-25 20:21:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-08-25 20:21:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5059760956175299) internal successors, (378), 251 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2021-08-25 20:21:20,647 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2021-08-25 20:21:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:20,647 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2021-08-25 20:21:20,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2021-08-25 20:21:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:21:20,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:20,648 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:20,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:21:20,649 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2021-08-25 20:21:20,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:20,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534175843] [2021-08-25 20:21:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:20,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:20,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:20,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534175843] [2021-08-25 20:21:20,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534175843] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:20,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:20,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:20,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407164494] [2021-08-25 20:21:20,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:20,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:20,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:20,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:20,689 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:20,957 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2021-08-25 20:21:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:21:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:20,958 INFO L225 Difference]: With dead ends: 535 [2021-08-25 20:21:20,958 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:21:20,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:21:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-08-25 20:21:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2021-08-25 20:21:20,963 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2021-08-25 20:21:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:20,963 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2021-08-25 20:21:20,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2021-08-25 20:21:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:21:20,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:20,964 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:20,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:21:20,965 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2021-08-25 20:21:20,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:20,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373681671] [2021-08-25 20:21:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:20,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:21,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:21,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373681671] [2021-08-25 20:21:21,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373681671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:21,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:21,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:21,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304310521] [2021-08-25 20:21:21,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:21,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:21,010 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:21,216 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2021-08-25 20:21:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:21:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:21,218 INFO L225 Difference]: With dead ends: 506 [2021-08-25 20:21:21,218 INFO L226 Difference]: Without dead ends: 273 [2021-08-25 20:21:21,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-25 20:21:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-08-25 20:21:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2021-08-25 20:21:21,224 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2021-08-25 20:21:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:21,225 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2021-08-25 20:21:21,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2021-08-25 20:21:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:21:21,225 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:21,226 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:21,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:21:21,226 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2021-08-25 20:21:21,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:21,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773009512] [2021-08-25 20:21:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:21,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:21,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:21,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773009512] [2021-08-25 20:21:21,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773009512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:21,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:21,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:21,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940601246] [2021-08-25 20:21:21,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:21,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:21,325 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:21,590 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2021-08-25 20:21:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:21:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:21,611 INFO L225 Difference]: With dead ends: 535 [2021-08-25 20:21:21,611 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:21:21,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:21:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-08-25 20:21:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4940239043824701) internal successors, (375), 251 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2021-08-25 20:21:21,637 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2021-08-25 20:21:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:21,638 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2021-08-25 20:21:21,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2021-08-25 20:21:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 20:21:21,639 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:21,640 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:21,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:21:21,641 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2021-08-25 20:21:21,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:21,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902739363] [2021-08-25 20:21:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:21,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:21,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:21,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902739363] [2021-08-25 20:21:21,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902739363] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:21,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:21,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:21,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775562308] [2021-08-25 20:21:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:21,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:21,714 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:21,912 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2021-08-25 20:21:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-08-25 20:21:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:21,913 INFO L225 Difference]: With dead ends: 506 [2021-08-25 20:21:21,913 INFO L226 Difference]: Without dead ends: 273 [2021-08-25 20:21:21,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-25 20:21:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-08-25 20:21:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4900398406374502) internal successors, (374), 251 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2021-08-25 20:21:21,919 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2021-08-25 20:21:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:21,919 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2021-08-25 20:21:21,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2021-08-25 20:21:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:21:21,920 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:21,920 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:21,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:21:21,920 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2021-08-25 20:21:21,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:21,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049366868] [2021-08-25 20:21:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:21,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:21,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:21,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049366868] [2021-08-25 20:21:21,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049366868] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:21,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:21,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:21,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543506058] [2021-08-25 20:21:21,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:21,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:21,993 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:22,261 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2021-08-25 20:21:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:22,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:21:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:22,263 INFO L225 Difference]: With dead ends: 525 [2021-08-25 20:21:22,263 INFO L226 Difference]: Without dead ends: 292 [2021-08-25 20:21:22,263 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-25 20:21:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2021-08-25 20:21:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2021-08-25 20:21:22,268 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2021-08-25 20:21:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:22,268 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2021-08-25 20:21:22,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2021-08-25 20:21:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:21:22,269 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:22,269 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:22,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:21:22,269 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2021-08-25 20:21:22,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:22,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573221372] [2021-08-25 20:21:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:22,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:22,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:22,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573221372] [2021-08-25 20:21:22,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573221372] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:22,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:22,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:22,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487063475] [2021-08-25 20:21:22,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:22,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:22,311 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:22,515 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2021-08-25 20:21:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-25 20:21:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:22,516 INFO L225 Difference]: With dead ends: 496 [2021-08-25 20:21:22,517 INFO L226 Difference]: Without dead ends: 263 [2021-08-25 20:21:22,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-25 20:21:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2021-08-25 20:21:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4820717131474104) internal successors, (372), 251 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2021-08-25 20:21:22,521 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2021-08-25 20:21:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:22,521 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2021-08-25 20:21:22,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2021-08-25 20:21:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:22,522 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:22,523 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:22,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:21:22,523 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2021-08-25 20:21:22,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:22,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907976441] [2021-08-25 20:21:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:22,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:22,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:22,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907976441] [2021-08-25 20:21:22,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907976441] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:22,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:22,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:21:22,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450896368] [2021-08-25 20:21:22,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:22,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:22,563 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:22,823 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2021-08-25 20:21:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:22,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:21:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:22,824 INFO L225 Difference]: With dead ends: 525 [2021-08-25 20:21:22,824 INFO L226 Difference]: Without dead ends: 292 [2021-08-25 20:21:22,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:21:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-25 20:21:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2021-08-25 20:21:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4780876494023905) internal successors, (371), 251 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2021-08-25 20:21:22,829 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2021-08-25 20:21:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:22,829 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2021-08-25 20:21:22,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2021-08-25 20:21:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:22,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:22,831 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:21:22,831 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2021-08-25 20:21:22,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:22,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137722720] [2021-08-25 20:21:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:22,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:21:22,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:22,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137722720] [2021-08-25 20:21:22,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137722720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:22,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:22,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:22,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243805842] [2021-08-25 20:21:22,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:22,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:22,866 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:22,902 INFO L93 Difference]: Finished difference Result 714 states and 1066 transitions. [2021-08-25 20:21:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:21:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:22,904 INFO L225 Difference]: With dead ends: 714 [2021-08-25 20:21:22,904 INFO L226 Difference]: Without dead ends: 481 [2021-08-25 20:21:22,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-25 20:21:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2021-08-25 20:21:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.48125) internal successors, (711), 480 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 711 transitions. [2021-08-25 20:21:22,913 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 711 transitions. Word has length 106 [2021-08-25 20:21:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:22,913 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 711 transitions. [2021-08-25 20:21:22,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 711 transitions. [2021-08-25 20:21:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:22,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:22,914 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:22,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:21:22,915 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash 888288017, now seen corresponding path program 1 times [2021-08-25 20:21:22,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:22,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597297991] [2021-08-25 20:21:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:22,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-25 20:21:22,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:22,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597297991] [2021-08-25 20:21:22,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597297991] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:22,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:22,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:22,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009029456] [2021-08-25 20:21:22,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:22,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:22,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:22,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:22,943 INFO L87 Difference]: Start difference. First operand 481 states and 711 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-08-25 20:21:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:22,985 INFO L93 Difference]: Finished difference Result 970 states and 1437 transitions. [2021-08-25 20:21:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:22,986 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-08-25 20:21:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:22,987 INFO L225 Difference]: With dead ends: 970 [2021-08-25 20:21:22,987 INFO L226 Difference]: Without dead ends: 508 [2021-08-25 20:21:22,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-08-25 20:21:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-08-25 20:21:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4714003944773175) internal successors, (746), 507 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 746 transitions. [2021-08-25 20:21:22,999 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 746 transitions. Word has length 106 [2021-08-25 20:21:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:22,999 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 746 transitions. [2021-08-25 20:21:22,999 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-08-25 20:21:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 746 transitions. [2021-08-25 20:21:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:21:23,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:23,000 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:23,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:21:23,001 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 302011795, now seen corresponding path program 1 times [2021-08-25 20:21:23,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:23,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690515790] [2021-08-25 20:21:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:23,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-25 20:21:23,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:23,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690515790] [2021-08-25 20:21:23,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690515790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:23,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:23,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:23,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635156875] [2021-08-25 20:21:23,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:23,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:23,030 INFO L87 Difference]: Start difference. First operand 508 states and 746 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:23,047 INFO L93 Difference]: Finished difference Result 999 states and 1473 transitions. [2021-08-25 20:21:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:21:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:23,049 INFO L225 Difference]: With dead ends: 999 [2021-08-25 20:21:23,049 INFO L226 Difference]: Without dead ends: 510 [2021-08-25 20:21:23,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-08-25 20:21:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-08-25 20:21:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.469548133595285) internal successors, (748), 509 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 748 transitions. [2021-08-25 20:21:23,060 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 748 transitions. Word has length 106 [2021-08-25 20:21:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:23,060 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 748 transitions. [2021-08-25 20:21:23,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 748 transitions. [2021-08-25 20:21:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:21:23,062 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:23,062 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:23,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:21:23,062 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2021-08-25 20:21:23,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:23,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847938648] [2021-08-25 20:21:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:23,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-08-25 20:21:23,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:21:23,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847938648] [2021-08-25 20:21:23,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847938648] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:23,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:23,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:21:23,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022738908] [2021-08-25 20:21:23,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:21:23,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:21:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:21:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:23,106 INFO L87 Difference]: Start difference. First operand 510 states and 748 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-08-25 20:21:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:23,149 INFO L93 Difference]: Finished difference Result 999 states and 1472 transitions. [2021-08-25 20:21:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:21:23,149 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-08-25 20:21:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:23,151 INFO L225 Difference]: With dead ends: 999 [2021-08-25 20:21:23,151 INFO L226 Difference]: Without dead ends: 510 [2021-08-25 20:21:23,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:21:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-08-25 20:21:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-08-25 20:21:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.4597249508840864) internal successors, (743), 509 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 743 transitions. [2021-08-25 20:21:23,160 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 743 transitions. Word has length 125 [2021-08-25 20:21:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:23,160 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 743 transitions. [2021-08-25 20:21:23,161 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-08-25 20:21:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 743 transitions. [2021-08-25 20:21:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-08-25 20:21:23,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:23,162 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:23,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:21:23,163 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2021-08-25 20:21:23,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:21:23,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346210973] [2021-08-25 20:21:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:23,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:21:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:23,250 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:21:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:23,355 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:21:23,356 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:21:23,356 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:21:23,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:21:23,363 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:21:23,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:21:23 BoogieIcfgContainer [2021-08-25 20:21:23,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:21:23,463 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:21:23,463 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:21:23,463 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:21:23,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:11" (3/4) ... [2021-08-25 20:21:23,467 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:21:23,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:21:23,469 INFO L168 Benchmark]: Toolchain (without parser) took 13038.63 ms. Allocated memory was 54.5 MB in the beginning and 346.0 MB in the end (delta: 291.5 MB). Free memory was 37.3 MB in the beginning and 195.1 MB in the end (delta: -157.7 MB). Peak memory consumption was 133.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,469 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:21:23,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.67 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 31.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.64 ms. Allocated memory is still 54.5 MB. Free memory was 31.7 MB in the beginning and 27.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,470 INFO L168 Benchmark]: Boogie Preprocessor took 88.18 ms. Allocated memory is still 54.5 MB. Free memory was 27.0 MB in the beginning and 20.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,470 INFO L168 Benchmark]: RCFGBuilder took 700.88 ms. Allocated memory was 54.5 MB in the beginning and 79.7 MB in the end (delta: 25.2 MB). Free memory was 20.4 MB in the beginning and 39.1 MB in the end (delta: -18.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,470 INFO L168 Benchmark]: TraceAbstraction took 11657.09 ms. Allocated memory was 79.7 MB in the beginning and 346.0 MB in the end (delta: 266.3 MB). Free memory was 38.7 MB in the beginning and 195.1 MB in the end (delta: -156.4 MB). Peak memory consumption was 109.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:23,471 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 346.0 MB. Free memory is still 195.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:21:23,472 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.14 ms. Allocated memory is still 44.0 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 506.67 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 31.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.64 ms. Allocated memory is still 54.5 MB. Free memory was 31.7 MB in the beginning and 27.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.18 ms. Allocated memory is still 54.5 MB. Free memory was 27.0 MB in the beginning and 20.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 700.88 ms. Allocated memory was 54.5 MB in the beginning and 79.7 MB in the end (delta: 25.2 MB). Free memory was 20.4 MB in the beginning and 39.1 MB in the end (delta: -18.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11657.09 ms. Allocated memory was 79.7 MB in the beginning and 346.0 MB in the end (delta: 266.3 MB). Free memory was 38.7 MB in the beginning and 195.1 MB in the end (delta: -156.4 MB). Peak memory consumption was 109.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.21 ms. Allocated memory is still 346.0 MB. Free memory is still 195.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1708]: 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 1122. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={5:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp = __VERIFIER_nondet_long() ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 ; [L1097] int tmp___4 ; [L1098] int tmp___5 ; [L1099] int tmp___6 ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 ; [L1103] int tmp___10 ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] Time = tmp [L1112] cb = (void (*)())((void *)0) [L1113] ret = -1 [L1114] skip = 0 [L1115] got_new_session = 0 [L1116] EXPR s->info_callback VAL [init=1, SSLv3_server_data={5:0}] [L1116] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1117] EXPR s->info_callback [L1117] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={5:0}] [L1131] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1131] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1164] COND TRUE s->state == 8464 [L1320] s->shutdown = 0 [L1321] ret = __VERIFIER_nondet_int() [L1322] COND TRUE blastFlag == 0 [L1323] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1327] COND FALSE !(ret <= 0) [L1332] got_new_session = 1 [L1333] s->state = 8496 [L1334] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1173] COND TRUE s->state == 8496 [L1338] ret = __VERIFIER_nondet_int() [L1339] COND TRUE blastFlag == 1 [L1340] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1344] COND FALSE !(ret <= 0) [L1349] s->hit VAL [init=1, SSLv3_server_data={5:0}] [L1349] COND TRUE s->hit [L1350] s->state = 8656 VAL [init=1, SSLv3_server_data={5:0}] [L1354] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1230] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] tmp___9 = __VERIFIER_nondet_int() [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 5 VAL [init=1, SSLv3_server_data={5:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 [L1575] tmp___10 = __VERIFIER_nondet_int() [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={5:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1230] COND FALSE !(s->state == 8656) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1233] COND FALSE !(s->state == 8657) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1236] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={5:0}] [L1589] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={5:0}] [L1708] reach_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11511.8ms, OverallIterations: 42, TraceHistogramMax: 4, EmptinessCheckTime: 34.8ms, AutomataDifference: 8925.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 8012 SDtfs, 2270 SDslu, 11389 SDs, 0 SdLazy, 6913 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6734.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 82 SyntacticMatches, 29 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 417.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=40, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 209.2ms AutomataMinimizationTime, 41 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 170.9ms SsaConstructionTime, 496.1ms SatisfiabilityAnalysisTime, 1255.7ms InterpolantComputationTime, 3646 NumberOfCodeBlocks, 3646 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3479 ConstructedInterpolants, 0 QuantifiedInterpolants, 9535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 1839/1839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:21:23,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:21:25,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:21:25,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:21:25,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:21:25,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:21:25,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:21:25,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:21:25,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:21:25,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:21:25,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:21:25,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:21:25,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:21:25,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:21:25,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:21:25,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:21:25,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:21:25,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:21:25,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:21:25,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:21:25,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:21:25,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:21:25,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:21:25,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:21:25,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:21:25,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:21:25,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:21:25,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:21:25,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:21:25,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:21:25,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:21:25,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:21:25,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:21:25,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:21:25,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:21:25,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:21:25,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:21:25,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:21:25,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:21:25,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:21:25,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:21:25,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:21:25,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:21:25,606 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:21:25,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:21:25,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:21:25,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:21:25,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:21:25,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:21:25,607 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:21:25,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:21:25,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:21:25,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:21:25,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:21:25,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:21:25,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:21:25,609 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:21:25,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:21:25,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:21:25,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:21:25,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:21:25,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:25,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:21:25,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:21:25,612 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 -> 77ee66abd2a03836cba1056e8b8f081ca3f237e1 [2021-08-25 20:21:25,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:21:25,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:21:25,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:21:25,848 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:21:25,848 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:21:25,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:25,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59baabe3/323729781705484bbf0cb7d5a90db150/FLAGec7b9c60d [2021-08-25 20:21:26,347 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:21:26,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:26,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59baabe3/323729781705484bbf0cb7d5a90db150/FLAGec7b9c60d [2021-08-25 20:21:26,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59baabe3/323729781705484bbf0cb7d5a90db150 [2021-08-25 20:21:26,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:21:26,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:21:26,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:26,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:21:26,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:21:26,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:26" (1/1) ... [2021-08-25 20:21:26,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d40d1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:26, skipping insertion in model container [2021-08-25 20:21:26,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:21:26" (1/1) ... [2021-08-25 20:21:26,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:21:26,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:21:27,051 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] [2021-08-25 20:21:27,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:27,091 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:21:27,201 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] [2021-08-25 20:21:27,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:21:27,216 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:21:27,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27 WrapperNode [2021-08-25 20:21:27,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:21:27,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:27,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:21:27,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:21:27,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:21:27,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:21:27,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:21:27,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:21:27,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:21:27,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:21:27,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:21:27,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:21:27,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (1/1) ... [2021-08-25 20:21:27,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:21:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:21:27,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:21:27,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:21:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:21:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:21:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:21:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:21:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:21:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:21:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:21:27,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:21:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:21:27,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:21:28,867 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-08-25 20:21:28,867 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-08-25 20:21:28,873 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:21:28,873 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:21:28,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:28 BoogieIcfgContainer [2021-08-25 20:21:28,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:21:28,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:21:28,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:21:28,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:21:28,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:21:26" (1/3) ... [2021-08-25 20:21:28,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:28, skipping insertion in model container [2021-08-25 20:21:28,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:21:27" (2/3) ... [2021-08-25 20:21:28,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:21:28, skipping insertion in model container [2021-08-25 20:21:28,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:28" (3/3) ... [2021-08-25 20:21:28,880 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2021-08-25 20:21:28,883 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:21:28,883 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:21:28,911 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:21:28,914 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:21:28,914 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:21:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 144 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:21:28,931 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:28,932 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:28,932 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2021-08-25 20:21:28,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:28,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089438182] [2021-08-25 20:21:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:28,953 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:28,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:28,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:28,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:21:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:29,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:21:29,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:21:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:29,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:21:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:29,524 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:21:29,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089438182] [2021-08-25 20:21:29,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089438182] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:29,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:29,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:21:29,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441654696] [2021-08-25 20:21:29,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:29,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:21:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:29,540 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 144 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:29,620 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2021-08-25 20:21:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:29,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:21:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:29,631 INFO L225 Difference]: With dead ends: 549 [2021-08-25 20:21:29,631 INFO L226 Difference]: Without dead ends: 373 [2021-08-25 20:21:29,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-25 20:21:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2021-08-25 20:21:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.518918918918919) internal successors, (562), 370 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2021-08-25 20:21:29,677 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2021-08-25 20:21:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:29,677 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2021-08-25 20:21:29,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2021-08-25 20:21:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-25 20:21:29,680 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:29,680 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:29,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:21:29,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:29,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2021-08-25 20:21:29,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:29,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935893171] [2021-08-25 20:21:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:29,899 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:29,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:29,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:21:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:30,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:21:30,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:21:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:30,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:21:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:21:30,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:21:30,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935893171] [2021-08-25 20:21:30,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935893171] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:30,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:30,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:21:30,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537401718] [2021-08-25 20:21:30,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:30,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:21:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:30,535 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:30,991 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2021-08-25 20:21:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-25 20:21:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:30,994 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:21:30,994 INFO L226 Difference]: Without dead ends: 611 [2021-08-25 20:21:30,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-08-25 20:21:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2021-08-25 20:21:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.5164473684210527) internal successors, (922), 608 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2021-08-25 20:21:31,021 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2021-08-25 20:21:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:31,022 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2021-08-25 20:21:31,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2021-08-25 20:21:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:21:31,027 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:31,027 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:31,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:21:31,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:31,238 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2021-08-25 20:21:31,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:31,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344059504] [2021-08-25 20:21:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:31,239 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:31,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:31,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:21:31,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:21:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:21:31,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:21:31,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:21:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:31,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:21:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-25 20:21:32,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:21:32,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344059504] [2021-08-25 20:21:32,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344059504] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:21:32,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:21:32,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:21:32,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112184378] [2021-08-25 20:21:32,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:21:32,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:21:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:21:32,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:32,201 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:21:32,490 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2021-08-25 20:21:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:21:32,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 123 [2021-08-25 20:21:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:21:32,494 INFO L225 Difference]: With dead ends: 1091 [2021-08-25 20:21:32,494 INFO L226 Difference]: Without dead ends: 611 [2021-08-25 20:21:32,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:21:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-08-25 20:21:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2021-08-25 20:21:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 1.5049180327868852) internal successors, (918), 610 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2021-08-25 20:21:32,515 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2021-08-25 20:21:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:21:32,516 INFO L470 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2021-08-25 20:21:32,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:21:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2021-08-25 20:21:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-08-25 20:21:32,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:21:32,520 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:21:32,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-25 20:21:32,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:21:32,731 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:21:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:21:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2021-08-25 20:21:32,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:21:32,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136723893] [2021-08-25 20:21:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:21:32,733 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:21:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:21:32,735 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-08-25 20:21:32,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:21:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:33,266 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:21:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:21:33,698 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:21:33,698 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:21:33,699 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:21:33,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:21:33,912 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-08-25 20:21:33,916 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:21:34,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:21:34 BoogieIcfgContainer [2021-08-25 20:21:34,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:21:34,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:21:34,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:21:34,019 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:21:34,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:21:28" (3/4) ... [2021-08-25 20:21:34,023 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:21:34,106 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:21:34,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:21:34,107 INFO L168 Benchmark]: Toolchain (without parser) took 7435.92 ms. Allocated memory was 48.2 MB in the beginning and 159.4 MB in the end (delta: 111.1 MB). Free memory was 33.0 MB in the beginning and 122.8 MB in the end (delta: -89.8 MB). Peak memory consumption was 91.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,107 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 48.2 MB. Free memory was 30.0 MB in the beginning and 29.9 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:21:34,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.80 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 32.7 MB in the beginning and 40.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 65.0 MB. Free memory was 40.3 MB in the beginning and 36.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,108 INFO L168 Benchmark]: Boogie Preprocessor took 67.93 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 28.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,108 INFO L168 Benchmark]: RCFGBuilder took 1517.06 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 28.9 MB in the beginning and 40.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,108 INFO L168 Benchmark]: TraceAbstraction took 5143.25 ms. Allocated memory was 86.0 MB in the beginning and 159.4 MB in the end (delta: 73.4 MB). Free memory was 39.4 MB in the beginning and 60.3 MB in the end (delta: -20.9 MB). Peak memory consumption was 52.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,109 INFO L168 Benchmark]: Witness Printer took 86.81 ms. Allocated memory is still 159.4 MB. Free memory was 60.3 MB in the beginning and 122.8 MB in the end (delta: -62.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:21:34,110 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 48.2 MB. Free memory was 30.0 MB in the beginning and 29.9 MB in the end (delta: 60.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 544.80 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 32.7 MB in the beginning and 40.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.11 ms. Allocated memory is still 65.0 MB. Free memory was 40.3 MB in the beginning and 36.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.93 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 28.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1517.06 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 28.9 MB in the beginning and 40.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5143.25 ms. Allocated memory was 86.0 MB in the beginning and 159.4 MB in the end (delta: 73.4 MB). Free memory was 39.4 MB in the beginning and 60.3 MB in the end (delta: -20.9 MB). Peak memory consumption was 52.0 MB. Max. memory is 16.1 GB. * Witness Printer took 86.81 ms. Allocated memory is still 159.4 MB. Free memory was 60.3 MB in the beginning and 122.8 MB in the end (delta: -62.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1708]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp = __VERIFIER_nondet_long() ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 ; [L1097] int tmp___4 ; [L1098] int tmp___5 ; [L1099] int tmp___6 ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 ; [L1103] int tmp___10 ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] Time = tmp [L1112] cb = (void (*)())((void *)0) [L1113] ret = -1 [L1114] skip = 0 [L1115] got_new_session = 0 [L1116] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1116] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1117] EXPR s->info_callback [L1117] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1131] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1131] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1164] COND TRUE s->state == 8464 [L1320] s->shutdown = 0 [L1321] ret = __VERIFIER_nondet_int() [L1322] COND TRUE blastFlag == 0 [L1323] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1327] COND FALSE !(ret <= 0) [L1332] got_new_session = 1 [L1333] s->state = 8496 [L1334] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND TRUE s->state == 8496 [L1338] ret = __VERIFIER_nondet_int() [L1339] COND TRUE blastFlag == 1 [L1340] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1344] COND FALSE !(ret <= 0) [L1349] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1349] COND TRUE s->hit [L1350] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1354] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1230] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] tmp___9 = __VERIFIER_nondet_int() [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 5 VAL [init=1, SSLv3_server_data={15:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 [L1575] tmp___10 = __VERIFIER_nondet_int() [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1230] COND FALSE !(s->state == 8656) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1233] COND FALSE !(s->state == 8657) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1236] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={15:0}] [L1589] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={15:0}] [L1708] reach_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5004.7ms, OverallIterations: 4, TraceHistogramMax: 4, EmptinessCheckTime: 17.9ms, AutomataDifference: 858.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 700.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 74.8ms AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 213.7ms SsaConstructionTime, 402.3ms SatisfiabilityAnalysisTime, 1511.2ms InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 1071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:21:34,157 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...