./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 102517b0f8c706bb18ba594655c7ea5e5902e987 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 102517b0f8c706bb18ba594655c7ea5e5902e987 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:41:11,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:41:11,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:41:11,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:41:11,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:41:11,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:41:11,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:41:11,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:41:11,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:41:11,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:41:11,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:41:11,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:41:11,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:41:11,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:41:11,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:41:11,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:41:11,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:41:11,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:41:11,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:41:11,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:41:11,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:41:11,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:41:11,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:41:11,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:41:11,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:41:11,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:41:11,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:41:11,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:41:11,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:41:11,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:41:11,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:41:11,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:41:11,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:41:11,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:41:11,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:41:11,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:41:11,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:41:11,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:41:11,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:41:11,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:41:11,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:41:11,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:41:11,396 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:41:11,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:41:11,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:41:11,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:41:11,400 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:41:11,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:41:11,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:41:11,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:41:11,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:41:11,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:41:11,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:41:11,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:41:11,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:41:11,402 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:41:11,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:41:11,403 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:41:11,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:41:11,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:41:11,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:41:11,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:41:11,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:41:11,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:41:11,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:41:11,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:41:11,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:41:11,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:41:11,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:41:11,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:41:11,407 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:41:11,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 102517b0f8c706bb18ba594655c7ea5e5902e987 [2020-10-25 19:41:11,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:41:11,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:41:11,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:41:11,860 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:41:11,861 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:41:11,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:11,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742e0f182/f0e3c4be1b8b4a02999c79ce2b3fcbe5/FLAG9c970dde6 [2020-10-25 19:41:12,737 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:41:12,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:12,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742e0f182/f0e3c4be1b8b4a02999c79ce2b3fcbe5/FLAG9c970dde6 [2020-10-25 19:41:12,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742e0f182/f0e3c4be1b8b4a02999c79ce2b3fcbe5 [2020-10-25 19:41:12,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:41:12,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:41:12,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:12,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:41:12,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:41:12,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:12" (1/1) ... [2020-10-25 19:41:12,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c5dc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:12, skipping insertion in model container [2020-10-25 19:41:12,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:12" (1/1) ... [2020-10-25 19:41:12,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:41:13,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:41:13,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:13,748 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:41:13,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:14,000 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:41:14,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14 WrapperNode [2020-10-25 19:41:14,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:14,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:14,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:41:14,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:41:14,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:14,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:41:14,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:41:14,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:41:14,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... [2020-10-25 19:41:14,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:41:14,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:41:14,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:41:14,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:41:14,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:41:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 19:41:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:41:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 19:41:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 19:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 19:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 19:41:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:41:14,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:41:14,759 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:41:15,666 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-10-25 19:41:15,666 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-10-25 19:41:15,684 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:41:15,684 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:41:15,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:15 BoogieIcfgContainer [2020-10-25 19:41:15,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:41:15,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:41:15,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:41:15,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:41:15,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:41:12" (1/3) ... [2020-10-25 19:41:15,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6b613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:15, skipping insertion in model container [2020-10-25 19:41:15,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:14" (2/3) ... [2020-10-25 19:41:15,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6b613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:15, skipping insertion in model container [2020-10-25 19:41:15,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:15" (3/3) ... [2020-10-25 19:41:15,696 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:15,709 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:41:15,715 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:41:15,730 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:41:15,761 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:41:15,761 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:41:15,761 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:41:15,761 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:41:15,762 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:41:15,762 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:41:15,762 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:41:15,762 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:41:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-10-25 19:41:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:41:15,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:15,794 INFO L422 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] [2020-10-25 19:41:15,794 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2020-10-25 19:41:15,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:15,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927067297] [2020-10-25 19:41:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:16,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927067297] [2020-10-25 19:41:16,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:16,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:16,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458879361] [2020-10-25 19:41:16,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:16,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:16,283 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2020-10-25 19:41:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:16,833 INFO L93 Difference]: Finished difference Result 314 states and 528 transitions. [2020-10-25 19:41:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:16,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-10-25 19:41:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:16,850 INFO L225 Difference]: With dead ends: 314 [2020-10-25 19:41:16,850 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 19:41:16,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 19:41:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-25 19:41:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2020-10-25 19:41:16,912 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2020-10-25 19:41:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:16,912 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2020-10-25 19:41:16,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2020-10-25 19:41:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-25 19:41:16,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:16,916 INFO L422 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] [2020-10-25 19:41:16,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:41:16,917 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2020-10-25 19:41:16,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:16,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865807159] [2020-10-25 19:41:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:17,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865807159] [2020-10-25 19:41:17,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:17,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:17,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354129906] [2020-10-25 19:41:17,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:17,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:17,094 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2020-10-25 19:41:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:17,525 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2020-10-25 19:41:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:17,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-10-25 19:41:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:17,529 INFO L225 Difference]: With dead ends: 280 [2020-10-25 19:41:17,529 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 19:41:17,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 19:41:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-25 19:41:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2020-10-25 19:41:17,558 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2020-10-25 19:41:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:17,558 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2020-10-25 19:41:17,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2020-10-25 19:41:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:17,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:17,564 INFO L422 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] [2020-10-25 19:41:17,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:41:17,564 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2020-10-25 19:41:17,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:17,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159540478] [2020-10-25 19:41:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:17,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159540478] [2020-10-25 19:41:17,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:17,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:17,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032153610] [2020-10-25 19:41:17,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:17,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:17,731 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2020-10-25 19:41:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:18,161 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2020-10-25 19:41:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:18,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:18,164 INFO L225 Difference]: With dead ends: 279 [2020-10-25 19:41:18,164 INFO L226 Difference]: Without dead ends: 157 [2020-10-25 19:41:18,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-25 19:41:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2020-10-25 19:41:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2020-10-25 19:41:18,177 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2020-10-25 19:41:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:18,177 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2020-10-25 19:41:18,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2020-10-25 19:41:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:18,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:18,180 INFO L422 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] [2020-10-25 19:41:18,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:41:18,181 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2020-10-25 19:41:18,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:18,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451337350] [2020-10-25 19:41:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:18,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451337350] [2020-10-25 19:41:18,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:18,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:18,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228859074] [2020-10-25 19:41:18,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:18,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:18,278 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2020-10-25 19:41:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:18,630 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2020-10-25 19:41:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:18,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:18,632 INFO L225 Difference]: With dead ends: 277 [2020-10-25 19:41:18,632 INFO L226 Difference]: Without dead ends: 155 [2020-10-25 19:41:18,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-25 19:41:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2020-10-25 19:41:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2020-10-25 19:41:18,642 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2020-10-25 19:41:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:18,642 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2020-10-25 19:41:18,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2020-10-25 19:41:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:18,643 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:18,644 INFO L422 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] [2020-10-25 19:41:18,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:41:18,644 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2020-10-25 19:41:18,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:18,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653189193] [2020-10-25 19:41:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:18,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653189193] [2020-10-25 19:41:18,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:18,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:18,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364828344] [2020-10-25 19:41:18,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:18,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:18,724 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2020-10-25 19:41:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:19,237 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2020-10-25 19:41:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:19,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:19,239 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:19,240 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:19,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2020-10-25 19:41:19,247 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2020-10-25 19:41:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:19,248 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2020-10-25 19:41:19,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2020-10-25 19:41:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:19,249 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:19,249 INFO L422 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] [2020-10-25 19:41:19,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:41:19,249 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2020-10-25 19:41:19,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:19,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907449487] [2020-10-25 19:41:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:19,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907449487] [2020-10-25 19:41:19,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:19,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:19,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674968580] [2020-10-25 19:41:19,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:19,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:19,336 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2020-10-25 19:41:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:19,737 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2020-10-25 19:41:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:19,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:19,741 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:19,741 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:19,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2020-10-25 19:41:19,754 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2020-10-25 19:41:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:19,755 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2020-10-25 19:41:19,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2020-10-25 19:41:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-25 19:41:19,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:19,756 INFO L422 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] [2020-10-25 19:41:19,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:41:19,756 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:19,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2020-10-25 19:41:19,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:19,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224185265] [2020-10-25 19:41:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:19,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224185265] [2020-10-25 19:41:19,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:19,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:19,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499791334] [2020-10-25 19:41:19,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:19,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:19,871 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2020-10-25 19:41:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:20,295 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2020-10-25 19:41:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:20,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-25 19:41:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:20,298 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:20,298 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:20,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2020-10-25 19:41:20,304 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2020-10-25 19:41:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:20,305 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2020-10-25 19:41:20,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2020-10-25 19:41:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-25 19:41:20,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:20,306 INFO L422 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] [2020-10-25 19:41:20,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:41:20,306 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2020-10-25 19:41:20,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:20,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887907583] [2020-10-25 19:41:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:20,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887907583] [2020-10-25 19:41:20,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:20,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:20,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179568938] [2020-10-25 19:41:20,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:20,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:20,376 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2020-10-25 19:41:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:20,774 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2020-10-25 19:41:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:20,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-25 19:41:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:20,777 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:20,777 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:20,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2020-10-25 19:41:20,783 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2020-10-25 19:41:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:20,783 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2020-10-25 19:41:20,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2020-10-25 19:41:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-25 19:41:20,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:20,784 INFO L422 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] [2020-10-25 19:41:20,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:41:20,785 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2020-10-25 19:41:20,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:20,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136057813] [2020-10-25 19:41:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:20,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136057813] [2020-10-25 19:41:20,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:20,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:20,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614792621] [2020-10-25 19:41:20,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:20,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:20,859 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2020-10-25 19:41:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:21,220 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2020-10-25 19:41:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:21,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-25 19:41:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:21,224 INFO L225 Difference]: With dead ends: 266 [2020-10-25 19:41:21,224 INFO L226 Difference]: Without dead ends: 144 [2020-10-25 19:41:21,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-25 19:41:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2020-10-25 19:41:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2020-10-25 19:41:21,235 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2020-10-25 19:41:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:21,238 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2020-10-25 19:41:21,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2020-10-25 19:41:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-25 19:41:21,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:21,243 INFO L422 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] [2020-10-25 19:41:21,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:41:21,243 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2020-10-25 19:41:21,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:21,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960939999] [2020-10-25 19:41:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:21,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960939999] [2020-10-25 19:41:21,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:21,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:21,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833067380] [2020-10-25 19:41:21,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:21,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:21,309 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2020-10-25 19:41:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:21,734 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2020-10-25 19:41:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:21,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-25 19:41:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:21,737 INFO L225 Difference]: With dead ends: 307 [2020-10-25 19:41:21,738 INFO L226 Difference]: Without dead ends: 185 [2020-10-25 19:41:21,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-25 19:41:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2020-10-25 19:41:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2020-10-25 19:41:21,755 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2020-10-25 19:41:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:21,755 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2020-10-25 19:41:21,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2020-10-25 19:41:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-25 19:41:21,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:21,760 INFO L422 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] [2020-10-25 19:41:21,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:41:21,760 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2020-10-25 19:41:21,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:21,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678560835] [2020-10-25 19:41:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:21,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678560835] [2020-10-25 19:41:21,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:21,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:21,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123099932] [2020-10-25 19:41:21,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:21,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:21,832 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2020-10-25 19:41:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:22,247 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2020-10-25 19:41:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:22,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-25 19:41:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:22,250 INFO L225 Difference]: With dead ends: 329 [2020-10-25 19:41:22,250 INFO L226 Difference]: Without dead ends: 185 [2020-10-25 19:41:22,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-25 19:41:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2020-10-25 19:41:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2020-10-25 19:41:22,257 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2020-10-25 19:41:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:22,257 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2020-10-25 19:41:22,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2020-10-25 19:41:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:22,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:22,258 INFO L422 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] [2020-10-25 19:41:22,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:41:22,259 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2020-10-25 19:41:22,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:22,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886689500] [2020-10-25 19:41:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:22,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886689500] [2020-10-25 19:41:22,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:22,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:22,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146098364] [2020-10-25 19:41:22,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:22,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:22,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:22,323 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2020-10-25 19:41:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:22,673 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2020-10-25 19:41:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:22,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:22,675 INFO L225 Difference]: With dead ends: 328 [2020-10-25 19:41:22,675 INFO L226 Difference]: Without dead ends: 184 [2020-10-25 19:41:22,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-25 19:41:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-10-25 19:41:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2020-10-25 19:41:22,682 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2020-10-25 19:41:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:22,682 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2020-10-25 19:41:22,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2020-10-25 19:41:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:22,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:22,683 INFO L422 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] [2020-10-25 19:41:22,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:41:22,683 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2020-10-25 19:41:22,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:22,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441709346] [2020-10-25 19:41:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:22,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441709346] [2020-10-25 19:41:22,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:22,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:22,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058364176] [2020-10-25 19:41:22,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:22,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:22,750 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2020-10-25 19:41:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:23,176 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2020-10-25 19:41:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:23,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:23,180 INFO L225 Difference]: With dead ends: 326 [2020-10-25 19:41:23,180 INFO L226 Difference]: Without dead ends: 182 [2020-10-25 19:41:23,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-25 19:41:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2020-10-25 19:41:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2020-10-25 19:41:23,198 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2020-10-25 19:41:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:23,199 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2020-10-25 19:41:23,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2020-10-25 19:41:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:23,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:23,203 INFO L422 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] [2020-10-25 19:41:23,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:41:23,204 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2020-10-25 19:41:23,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:23,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710138104] [2020-10-25 19:41:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:23,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710138104] [2020-10-25 19:41:23,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:23,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:23,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817171174] [2020-10-25 19:41:23,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:23,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:23,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:23,331 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2020-10-25 19:41:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:23,741 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2020-10-25 19:41:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:23,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:23,743 INFO L225 Difference]: With dead ends: 325 [2020-10-25 19:41:23,743 INFO L226 Difference]: Without dead ends: 181 [2020-10-25 19:41:23,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-25 19:41:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-10-25 19:41:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2020-10-25 19:41:23,753 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2020-10-25 19:41:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:23,754 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2020-10-25 19:41:23,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2020-10-25 19:41:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:23,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:23,755 INFO L422 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] [2020-10-25 19:41:23,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:41:23,756 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2020-10-25 19:41:23,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:23,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512116462] [2020-10-25 19:41:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:23,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512116462] [2020-10-25 19:41:23,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:23,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:23,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009206236] [2020-10-25 19:41:23,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:23,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:23,834 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2020-10-25 19:41:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:24,233 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2020-10-25 19:41:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:24,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:24,236 INFO L225 Difference]: With dead ends: 325 [2020-10-25 19:41:24,236 INFO L226 Difference]: Without dead ends: 181 [2020-10-25 19:41:24,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-25 19:41:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-10-25 19:41:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2020-10-25 19:41:24,242 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2020-10-25 19:41:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:24,243 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2020-10-25 19:41:24,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2020-10-25 19:41:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-25 19:41:24,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:24,247 INFO L422 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] [2020-10-25 19:41:24,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:41:24,247 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2020-10-25 19:41:24,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:24,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636962602] [2020-10-25 19:41:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:24,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636962602] [2020-10-25 19:41:24,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:24,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:24,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793134974] [2020-10-25 19:41:24,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:24,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:24,313 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2020-10-25 19:41:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:24,693 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2020-10-25 19:41:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:24,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-25 19:41:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:24,696 INFO L225 Difference]: With dead ends: 325 [2020-10-25 19:41:24,697 INFO L226 Difference]: Without dead ends: 181 [2020-10-25 19:41:24,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-25 19:41:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-10-25 19:41:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-10-25 19:41:24,709 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2020-10-25 19:41:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:24,710 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-10-25 19:41:24,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-10-25 19:41:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-25 19:41:24,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:24,713 INFO L422 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] [2020-10-25 19:41:24,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:41:24,713 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2020-10-25 19:41:24,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:24,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523741846] [2020-10-25 19:41:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:24,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523741846] [2020-10-25 19:41:24,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:24,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:24,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585643265] [2020-10-25 19:41:24,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:24,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:24,824 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2020-10-25 19:41:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:25,275 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2020-10-25 19:41:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:25,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-10-25 19:41:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:25,277 INFO L225 Difference]: With dead ends: 325 [2020-10-25 19:41:25,278 INFO L226 Difference]: Without dead ends: 181 [2020-10-25 19:41:25,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-25 19:41:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-10-25 19:41:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2020-10-25 19:41:25,286 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2020-10-25 19:41:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:25,286 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2020-10-25 19:41:25,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2020-10-25 19:41:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 19:41:25,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:25,288 INFO L422 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] [2020-10-25 19:41:25,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:41:25,288 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2020-10-25 19:41:25,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:25,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200648336] [2020-10-25 19:41:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:25,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200648336] [2020-10-25 19:41:25,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:25,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:25,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653656750] [2020-10-25 19:41:25,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:25,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:25,393 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2020-10-25 19:41:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:25,730 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2020-10-25 19:41:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:25,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-10-25 19:41:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:25,733 INFO L225 Difference]: With dead ends: 315 [2020-10-25 19:41:25,733 INFO L226 Difference]: Without dead ends: 171 [2020-10-25 19:41:25,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-25 19:41:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2020-10-25 19:41:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2020-10-25 19:41:25,740 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2020-10-25 19:41:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:25,740 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2020-10-25 19:41:25,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2020-10-25 19:41:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:41:25,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:25,742 INFO L422 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] [2020-10-25 19:41:25,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:41:25,742 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2020-10-25 19:41:25,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:25,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038074811] [2020-10-25 19:41:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:25,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038074811] [2020-10-25 19:41:25,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:25,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:25,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104044548] [2020-10-25 19:41:25,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:25,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:25,872 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2020-10-25 19:41:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:26,470 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2020-10-25 19:41:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:26,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-10-25 19:41:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:26,473 INFO L225 Difference]: With dead ends: 403 [2020-10-25 19:41:26,473 INFO L226 Difference]: Without dead ends: 259 [2020-10-25 19:41:26,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-10-25 19:41:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2020-10-25 19:41:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-10-25 19:41:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2020-10-25 19:41:26,482 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2020-10-25 19:41:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:26,482 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2020-10-25 19:41:26,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2020-10-25 19:41:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:41:26,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:26,484 INFO L422 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] [2020-10-25 19:41:26,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:41:26,484 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2020-10-25 19:41:26,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:26,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80723427] [2020-10-25 19:41:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:26,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80723427] [2020-10-25 19:41:26,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:26,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:26,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244498728] [2020-10-25 19:41:26,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:26,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:26,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:26,557 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2020-10-25 19:41:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:27,043 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2020-10-25 19:41:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:27,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-10-25 19:41:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:27,047 INFO L225 Difference]: With dead ends: 443 [2020-10-25 19:41:27,047 INFO L226 Difference]: Without dead ends: 256 [2020-10-25 19:41:27,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-25 19:41:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2020-10-25 19:41:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2020-10-25 19:41:27,057 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2020-10-25 19:41:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:27,058 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2020-10-25 19:41:27,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2020-10-25 19:41:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-25 19:41:27,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:27,060 INFO L422 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] [2020-10-25 19:41:27,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:41:27,060 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2020-10-25 19:41:27,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:27,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034766267] [2020-10-25 19:41:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:27,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034766267] [2020-10-25 19:41:27,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:27,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:27,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097428069] [2020-10-25 19:41:27,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:27,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:27,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:27,135 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2020-10-25 19:41:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:27,734 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2020-10-25 19:41:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:27,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-10-25 19:41:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:27,738 INFO L225 Difference]: With dead ends: 494 [2020-10-25 19:41:27,738 INFO L226 Difference]: Without dead ends: 283 [2020-10-25 19:41:27,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-10-25 19:41:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2020-10-25 19:41:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2020-10-25 19:41:27,750 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2020-10-25 19:41:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:27,751 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2020-10-25 19:41:27,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2020-10-25 19:41:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-25 19:41:27,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:27,753 INFO L422 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] [2020-10-25 19:41:27,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 19:41:27,753 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2020-10-25 19:41:27,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:27,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117453712] [2020-10-25 19:41:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:27,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117453712] [2020-10-25 19:41:27,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:27,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:27,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688823637] [2020-10-25 19:41:27,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:27,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:27,853 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2020-10-25 19:41:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:28,302 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2020-10-25 19:41:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:28,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-10-25 19:41:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:28,305 INFO L225 Difference]: With dead ends: 467 [2020-10-25 19:41:28,305 INFO L226 Difference]: Without dead ends: 256 [2020-10-25 19:41:28,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-25 19:41:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2020-10-25 19:41:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2020-10-25 19:41:28,314 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2020-10-25 19:41:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:28,314 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2020-10-25 19:41:28,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2020-10-25 19:41:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:28,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:28,316 INFO L422 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] [2020-10-25 19:41:28,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:41:28,316 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2020-10-25 19:41:28,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:28,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267466872] [2020-10-25 19:41:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:28,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267466872] [2020-10-25 19:41:28,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:28,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:28,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101568028] [2020-10-25 19:41:28,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:28,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:28,435 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2020-10-25 19:41:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:29,001 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2020-10-25 19:41:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:29,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:29,004 INFO L225 Difference]: With dead ends: 493 [2020-10-25 19:41:29,004 INFO L226 Difference]: Without dead ends: 282 [2020-10-25 19:41:29,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-25 19:41:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2020-10-25 19:41:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2020-10-25 19:41:29,013 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2020-10-25 19:41:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:29,014 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2020-10-25 19:41:29,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2020-10-25 19:41:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:29,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:29,015 INFO L422 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] [2020-10-25 19:41:29,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 19:41:29,015 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2020-10-25 19:41:29,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:29,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629346112] [2020-10-25 19:41:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:29,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629346112] [2020-10-25 19:41:29,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:29,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:29,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130678037] [2020-10-25 19:41:29,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:29,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:29,115 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2020-10-25 19:41:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:29,670 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2020-10-25 19:41:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:29,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:29,672 INFO L225 Difference]: With dead ends: 491 [2020-10-25 19:41:29,672 INFO L226 Difference]: Without dead ends: 280 [2020-10-25 19:41:29,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-25 19:41:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2020-10-25 19:41:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2020-10-25 19:41:29,681 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2020-10-25 19:41:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:29,681 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2020-10-25 19:41:29,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2020-10-25 19:41:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:29,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:29,682 INFO L422 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] [2020-10-25 19:41:29,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:41:29,683 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2020-10-25 19:41:29,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:29,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196162116] [2020-10-25 19:41:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:29,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196162116] [2020-10-25 19:41:29,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:29,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:29,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175670371] [2020-10-25 19:41:29,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:29,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:29,760 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2020-10-25 19:41:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:30,302 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2020-10-25 19:41:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:30,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:30,306 INFO L225 Difference]: With dead ends: 490 [2020-10-25 19:41:30,306 INFO L226 Difference]: Without dead ends: 279 [2020-10-25 19:41:30,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-10-25 19:41:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-10-25 19:41:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2020-10-25 19:41:30,314 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2020-10-25 19:41:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:30,314 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2020-10-25 19:41:30,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2020-10-25 19:41:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:30,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:30,324 INFO L422 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] [2020-10-25 19:41:30,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:41:30,325 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2020-10-25 19:41:30,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:30,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743798029] [2020-10-25 19:41:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-25 19:41:30,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743798029] [2020-10-25 19:41:30,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:30,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 19:41:30,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353468447] [2020-10-25 19:41:30,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 19:41:30,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 19:41:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:30,428 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2020-10-25 19:41:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:30,993 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2020-10-25 19:41:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 19:41:30,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-25 19:41:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:30,995 INFO L225 Difference]: With dead ends: 462 [2020-10-25 19:41:30,996 INFO L226 Difference]: Without dead ends: 251 [2020-10-25 19:41:30,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 19:41:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-25 19:41:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2020-10-25 19:41:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2020-10-25 19:41:31,005 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2020-10-25 19:41:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:31,005 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2020-10-25 19:41:31,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 19:41:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2020-10-25 19:41:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:31,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:31,007 INFO L422 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] [2020-10-25 19:41:31,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:41:31,008 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2020-10-25 19:41:31,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:31,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908990043] [2020-10-25 19:41:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:31,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908990043] [2020-10-25 19:41:31,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:31,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:31,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495543574] [2020-10-25 19:41:31,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:31,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:31,086 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2020-10-25 19:41:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:31,503 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2020-10-25 19:41:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:31,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:31,506 INFO L225 Difference]: With dead ends: 504 [2020-10-25 19:41:31,506 INFO L226 Difference]: Without dead ends: 273 [2020-10-25 19:41:31,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-25 19:41:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2020-10-25 19:41:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2020-10-25 19:41:31,516 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2020-10-25 19:41:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:31,516 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2020-10-25 19:41:31,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2020-10-25 19:41:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:31,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:31,518 INFO L422 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] [2020-10-25 19:41:31,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:41:31,518 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2020-10-25 19:41:31,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:31,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627489823] [2020-10-25 19:41:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:31,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627489823] [2020-10-25 19:41:31,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:31,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:31,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064065073] [2020-10-25 19:41:31,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:31,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:31,590 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2020-10-25 19:41:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:32,033 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2020-10-25 19:41:32,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:32,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:32,035 INFO L225 Difference]: With dead ends: 503 [2020-10-25 19:41:32,036 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 19:41:32,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 19:41:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-10-25 19:41:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2020-10-25 19:41:32,044 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2020-10-25 19:41:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:32,045 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2020-10-25 19:41:32,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2020-10-25 19:41:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:41:32,046 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:32,046 INFO L422 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] [2020-10-25 19:41:32,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:41:32,047 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2020-10-25 19:41:32,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:32,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262872728] [2020-10-25 19:41:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:32,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262872728] [2020-10-25 19:41:32,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:32,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:32,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638234032] [2020-10-25 19:41:32,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:32,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:32,120 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2020-10-25 19:41:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:32,700 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2020-10-25 19:41:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:32,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-10-25 19:41:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:32,703 INFO L225 Difference]: With dead ends: 530 [2020-10-25 19:41:32,703 INFO L226 Difference]: Without dead ends: 299 [2020-10-25 19:41:32,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-25 19:41:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-10-25 19:41:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2020-10-25 19:41:32,720 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2020-10-25 19:41:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:32,721 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2020-10-25 19:41:32,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2020-10-25 19:41:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:41:32,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:32,723 INFO L422 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] [2020-10-25 19:41:32,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:41:32,723 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2020-10-25 19:41:32,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:32,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357085754] [2020-10-25 19:41:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:32,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357085754] [2020-10-25 19:41:32,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:32,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:32,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659002103] [2020-10-25 19:41:32,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:32,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:32,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:32,818 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2020-10-25 19:41:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:33,201 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2020-10-25 19:41:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:33,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-10-25 19:41:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:33,204 INFO L225 Difference]: With dead ends: 503 [2020-10-25 19:41:33,205 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 19:41:33,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 19:41:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-10-25 19:41:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2020-10-25 19:41:33,215 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2020-10-25 19:41:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:33,215 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2020-10-25 19:41:33,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2020-10-25 19:41:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:41:33,217 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:33,217 INFO L422 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] [2020-10-25 19:41:33,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:41:33,217 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2020-10-25 19:41:33,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:33,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019928807] [2020-10-25 19:41:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:33,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019928807] [2020-10-25 19:41:33,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:33,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:33,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128933171] [2020-10-25 19:41:33,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:33,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:33,293 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2020-10-25 19:41:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:33,825 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2020-10-25 19:41:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:33,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-10-25 19:41:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:33,828 INFO L225 Difference]: With dead ends: 530 [2020-10-25 19:41:33,829 INFO L226 Difference]: Without dead ends: 299 [2020-10-25 19:41:33,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-25 19:41:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-10-25 19:41:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2020-10-25 19:41:33,840 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2020-10-25 19:41:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:33,840 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2020-10-25 19:41:33,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2020-10-25 19:41:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:41:33,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:33,841 INFO L422 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] [2020-10-25 19:41:33,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:41:33,843 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2020-10-25 19:41:33,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:33,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628746700] [2020-10-25 19:41:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:33,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628746700] [2020-10-25 19:41:33,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:33,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:33,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603975779] [2020-10-25 19:41:33,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:33,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:33,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:33,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:33,928 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2020-10-25 19:41:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:34,355 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2020-10-25 19:41:34,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:34,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-10-25 19:41:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:34,358 INFO L225 Difference]: With dead ends: 503 [2020-10-25 19:41:34,358 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 19:41:34,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 19:41:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-10-25 19:41:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2020-10-25 19:41:34,367 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2020-10-25 19:41:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:34,368 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2020-10-25 19:41:34,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2020-10-25 19:41:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:41:34,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:34,370 INFO L422 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] [2020-10-25 19:41:34,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 19:41:34,370 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:34,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2020-10-25 19:41:34,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:34,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705362388] [2020-10-25 19:41:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:34,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705362388] [2020-10-25 19:41:34,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:34,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:34,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648539765] [2020-10-25 19:41:34,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:34,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:34,454 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2020-10-25 19:41:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:35,009 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2020-10-25 19:41:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:35,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-10-25 19:41:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:35,013 INFO L225 Difference]: With dead ends: 530 [2020-10-25 19:41:35,013 INFO L226 Difference]: Without dead ends: 299 [2020-10-25 19:41:35,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-25 19:41:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-10-25 19:41:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2020-10-25 19:41:35,022 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2020-10-25 19:41:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:35,022 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2020-10-25 19:41:35,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2020-10-25 19:41:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:41:35,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:35,024 INFO L422 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] [2020-10-25 19:41:35,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:41:35,024 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2020-10-25 19:41:35,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:35,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061858371] [2020-10-25 19:41:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:35,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061858371] [2020-10-25 19:41:35,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:35,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:35,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527744095] [2020-10-25 19:41:35,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:35,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:35,096 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2020-10-25 19:41:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:35,526 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2020-10-25 19:41:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:35,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-10-25 19:41:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:35,529 INFO L225 Difference]: With dead ends: 503 [2020-10-25 19:41:35,529 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 19:41:35,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 19:41:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-10-25 19:41:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-10-25 19:41:35,540 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2020-10-25 19:41:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:35,540 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-10-25 19:41:35,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-10-25 19:41:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-25 19:41:35,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:35,541 INFO L422 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] [2020-10-25 19:41:35,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 19:41:35,542 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2020-10-25 19:41:35,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:35,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648408605] [2020-10-25 19:41:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:35,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648408605] [2020-10-25 19:41:35,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:35,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:35,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958037803] [2020-10-25 19:41:35,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:35,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:35,608 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2020-10-25 19:41:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:36,138 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2020-10-25 19:41:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:36,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-10-25 19:41:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:36,141 INFO L225 Difference]: With dead ends: 520 [2020-10-25 19:41:36,141 INFO L226 Difference]: Without dead ends: 289 [2020-10-25 19:41:36,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-25 19:41:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-10-25 19:41:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2020-10-25 19:41:36,153 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2020-10-25 19:41:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:36,153 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2020-10-25 19:41:36,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2020-10-25 19:41:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-25 19:41:36,154 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:36,154 INFO L422 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] [2020-10-25 19:41:36,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-25 19:41:36,155 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2020-10-25 19:41:36,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:36,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079318274] [2020-10-25 19:41:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:36,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079318274] [2020-10-25 19:41:36,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:36,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:36,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772332537] [2020-10-25 19:41:36,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:36,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:36,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:36,236 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2020-10-25 19:41:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:36,609 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2020-10-25 19:41:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:36,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-10-25 19:41:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:36,611 INFO L225 Difference]: With dead ends: 493 [2020-10-25 19:41:36,611 INFO L226 Difference]: Without dead ends: 262 [2020-10-25 19:41:36,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-25 19:41:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2020-10-25 19:41:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2020-10-25 19:41:36,621 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2020-10-25 19:41:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:36,621 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2020-10-25 19:41:36,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2020-10-25 19:41:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:36,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:36,623 INFO L422 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] [2020-10-25 19:41:36,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-25 19:41:36,624 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2020-10-25 19:41:36,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:36,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048851984] [2020-10-25 19:41:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 19:41:36,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048851984] [2020-10-25 19:41:36,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:36,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:36,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90698168] [2020-10-25 19:41:36,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:36,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:36,699 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2020-10-25 19:41:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,240 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2020-10-25 19:41:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:37,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-10-25 19:41:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,242 INFO L225 Difference]: With dead ends: 520 [2020-10-25 19:41:37,242 INFO L226 Difference]: Without dead ends: 289 [2020-10-25 19:41:37,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-25 19:41:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-10-25 19:41:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2020-10-25 19:41:37,253 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2020-10-25 19:41:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,253 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2020-10-25 19:41:37,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2020-10-25 19:41:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:37,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,255 INFO L422 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] [2020-10-25 19:41:37,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-25 19:41:37,255 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2020-10-25 19:41:37,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857816282] [2020-10-25 19:41:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-25 19:41:37,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857816282] [2020-10-25 19:41:37,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:37,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:37,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547380938] [2020-10-25 19:41:37,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:37,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,331 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2020-10-25 19:41:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,384 INFO L93 Difference]: Finished difference Result 708 states and 1057 transitions. [2020-10-25 19:41:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:37,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:41:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,388 INFO L225 Difference]: With dead ends: 708 [2020-10-25 19:41:37,388 INFO L226 Difference]: Without dead ends: 477 [2020-10-25 19:41:37,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-25 19:41:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-10-25 19:41:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-10-25 19:41:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 706 transitions. [2020-10-25 19:41:37,407 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 706 transitions. Word has length 106 [2020-10-25 19:41:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,407 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 706 transitions. [2020-10-25 19:41:37,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 706 transitions. [2020-10-25 19:41:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-10-25 19:41:37,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,409 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:41:37,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-25 19:41:37,409 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1521078267, now seen corresponding path program 1 times [2020-10-25 19:41:37,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31105305] [2020-10-25 19:41:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-25 19:41:37,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31105305] [2020-10-25 19:41:37,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:37,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:37,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453348824] [2020-10-25 19:41:37,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:37,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,487 INFO L87 Difference]: Start difference. First operand 477 states and 706 transitions. Second operand 3 states. [2020-10-25 19:41:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,548 INFO L93 Difference]: Finished difference Result 962 states and 1427 transitions. [2020-10-25 19:41:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:37,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-10-25 19:41:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,551 INFO L225 Difference]: With dead ends: 962 [2020-10-25 19:41:37,551 INFO L226 Difference]: Without dead ends: 504 [2020-10-25 19:41:37,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-10-25 19:41:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2020-10-25 19:41:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-25 19:41:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 741 transitions. [2020-10-25 19:41:37,571 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 741 transitions. Word has length 107 [2020-10-25 19:41:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,571 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 741 transitions. [2020-10-25 19:41:37,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 741 transitions. [2020-10-25 19:41:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-10-25 19:41:37,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,574 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:41:37,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-25 19:41:37,574 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1779195331, now seen corresponding path program 1 times [2020-10-25 19:41:37,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365281736] [2020-10-25 19:41:37,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-10-25 19:41:37,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365281736] [2020-10-25 19:41:37,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:37,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:37,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606918715] [2020-10-25 19:41:37,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:37,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,625 INFO L87 Difference]: Start difference. First operand 504 states and 741 transitions. Second operand 3 states. [2020-10-25 19:41:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,671 INFO L93 Difference]: Finished difference Result 991 states and 1463 transitions. [2020-10-25 19:41:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:37,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-10-25 19:41:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,675 INFO L225 Difference]: With dead ends: 991 [2020-10-25 19:41:37,675 INFO L226 Difference]: Without dead ends: 506 [2020-10-25 19:41:37,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-10-25 19:41:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-10-25 19:41:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-25 19:41:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 743 transitions. [2020-10-25 19:41:37,693 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 743 transitions. Word has length 107 [2020-10-25 19:41:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,693 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 743 transitions. [2020-10-25 19:41:37,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 743 transitions. [2020-10-25 19:41:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-25 19:41:37,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,696 INFO L422 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] [2020-10-25 19:41:37,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-25 19:41:37,696 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2020-10-25 19:41:37,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338631714] [2020-10-25 19:41:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:37,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:37,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:38,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 19:41:38,078 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:41:38,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-25 19:41:38,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:41:38 BoogieIcfgContainer [2020-10-25 19:41:38,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:41:38,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:41:38,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:41:38,251 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:41:38,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:15" (3/4) ... [2020-10-25 19:41:38,255 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 19:41:38,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:41:38,257 INFO L168 Benchmark]: Toolchain (without parser) took 25298.81 ms. Allocated memory was 44.0 MB in the beginning and 209.7 MB in the end (delta: 165.7 MB). Free memory was 25.4 MB in the beginning and 114.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 74.5 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,257 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 24.1 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:41:38,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1033.54 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 24.8 MB in the beginning and 28.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.39 ms. Allocated memory is still 54.5 MB. Free memory was 28.0 MB in the beginning and 23.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,259 INFO L168 Benchmark]: Boogie Preprocessor took 129.57 ms. Allocated memory is still 54.5 MB. Free memory was 23.7 MB in the beginning and 26.3 MB in the end (delta: -2.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,259 INFO L168 Benchmark]: RCFGBuilder took 1434.58 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 26.1 MB in the beginning and 54.6 MB in the end (delta: -28.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,260 INFO L168 Benchmark]: TraceAbstraction took 22561.58 ms. Allocated memory was 81.8 MB in the beginning and 209.7 MB in the end (delta: 127.9 MB). Free memory was 54.2 MB in the beginning and 115.7 MB in the end (delta: -61.5 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:38,260 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 209.7 MB. Free memory was 115.7 MB in the beginning and 114.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:41:38,262 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.32 ms. Allocated memory is still 44.0 MB. Free memory was 24.2 MB in the beginning and 24.1 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1033.54 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 24.8 MB in the beginning and 28.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 118.39 ms. Allocated memory is still 54.5 MB. Free memory was 28.0 MB in the beginning and 23.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 129.57 ms. Allocated memory is still 54.5 MB. Free memory was 23.7 MB in the beginning and 26.3 MB in the end (delta: -2.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1434.58 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 26.1 MB in the beginning and 54.6 MB in the end (delta: -28.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22561.58 ms. Allocated memory was 81.8 MB in the beginning and 209.7 MB in the end (delta: 127.9 MB). Free memory was 54.2 MB in the beginning and 115.7 MB in the end (delta: -61.5 MB). Peak memory consumption was 66.7 MB. Max. memory is 16.1 GB. * Witness Printer took 4.57 ms. Allocated memory is still 209.7 MB. Free memory was 115.7 MB in the beginning and 114.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1353] COND FALSE !(ret <= 0) [L1358] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1358] COND TRUE s->hit [L1359] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1363] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1556] EXPR s->session [L1556] EXPR s->s3 [L1556] EXPR (s->s3)->tmp.new_cipher [L1556] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1557] COND FALSE !(! tmp___9) [L1563] ret = __VERIFIER_nondet_int() [L1564] COND TRUE blastFlag == 2 [L1565] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={6:0}] [L3] __assert_fail("0", "s3_srvr.blast.02.i.cil-1.c", 3, "reach_error") VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.3s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7552 SDtfs, 2146 SDslu, 11009 SDs, 0 SdLazy, 6885 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3502 NumberOfCodeBlocks, 3502 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 763647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-5485861 [2020-10-25 19:41:40,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:41:40,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:41:40,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:41:40,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:41:40,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:41:40,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:41:40,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:41:40,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:41:40,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:41:40,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:41:40,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:41:40,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:41:40,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:41:40,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:41:40,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:41:40,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:41:40,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:41:40,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:41:40,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:41:40,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:41:40,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:41:40,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:41:40,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:41:40,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:41:40,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:41:40,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:41:40,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:41:40,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:41:40,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:41:40,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:41:40,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:41:40,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:41:40,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:41:40,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:41:40,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:41:40,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:41:40,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:41:40,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:41:40,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:41:40,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:41:40,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 19:41:40,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:41:40,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:41:40,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:41:40,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:41:40,989 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:41:40,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:41:40,990 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:41:40,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:41:40,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:41:40,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:41:40,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:41:40,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:41:40,991 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 19:41:40,992 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 19:41:40,992 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:41:40,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:41:40,992 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:41:40,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:41:40,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:41:40,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:41:40,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:41:40,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:41:40,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:41:40,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:41:40,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:41:40,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:41:40,995 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 19:41:40,995 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 19:41:40,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:41:40,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:41:40,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 19:41:40,996 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 102517b0f8c706bb18ba594655c7ea5e5902e987 [2020-10-25 19:41:41,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:41:41,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:41:41,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:41:41,499 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:41:41,500 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:41:41,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:41,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc929db/fae84fc21cf7427f8cddd86ac4c8a3c7/FLAG021b1f735 [2020-10-25 19:41:42,385 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:41:42,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:42,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc929db/fae84fc21cf7427f8cddd86ac4c8a3c7/FLAG021b1f735 [2020-10-25 19:41:42,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fc929db/fae84fc21cf7427f8cddd86ac4c8a3c7 [2020-10-25 19:41:42,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:41:42,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:41:42,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:42,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:41:42,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:41:42,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:42" (1/1) ... [2020-10-25 19:41:42,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d378ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:42, skipping insertion in model container [2020-10-25 19:41:42,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:42" (1/1) ... [2020-10-25 19:41:42,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:41:42,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:41:43,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:43,297 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:41:43,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:43,490 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:41:43,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43 WrapperNode [2020-10-25 19:41:43,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:43,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:43,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:41:43,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:41:43,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:43,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:41:43,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:41:43,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:41:43,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... [2020-10-25 19:41:43,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:41:43,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:41:43,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:41:43,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:41:43,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:41:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 19:41:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 19:41:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:41:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 19:41:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 19:41:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 19:41:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:41:43,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:41:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-10-25 19:41:44,103 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:41:46,975 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-10-25 19:41:46,975 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-10-25 19:41:46,985 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:41:46,986 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:41:46,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:46 BoogieIcfgContainer [2020-10-25 19:41:46,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:41:46,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:41:46,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:41:46,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:41:46,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:41:42" (1/3) ... [2020-10-25 19:41:46,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36790e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:46, skipping insertion in model container [2020-10-25 19:41:46,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:43" (2/3) ... [2020-10-25 19:41:46,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36790e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:46, skipping insertion in model container [2020-10-25 19:41:46,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:46" (3/3) ... [2020-10-25 19:41:46,997 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2020-10-25 19:41:47,010 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:41:47,016 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:41:47,030 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:41:47,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:41:47,061 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:41:47,073 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:41:47,074 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:41:47,074 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:41:47,074 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:41:47,074 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:41:47,074 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:41:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-10-25 19:41:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:41:47,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:47,105 INFO L422 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] [2020-10-25 19:41:47,105 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2020-10-25 19:41:47,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:41:47,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498073930] [2020-10-25 19:41:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-25 19:41:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:47,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:41:47,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:41:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:47,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:41:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:47,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498073930] [2020-10-25 19:41:47,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:47,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:41:47,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379684237] [2020-10-25 19:41:47,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:47,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:41:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:47,493 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2020-10-25 19:41:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:47,673 INFO L93 Difference]: Finished difference Result 538 states and 913 transitions. [2020-10-25 19:41:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:47,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-10-25 19:41:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:47,703 INFO L225 Difference]: With dead ends: 538 [2020-10-25 19:41:47,704 INFO L226 Difference]: Without dead ends: 363 [2020-10-25 19:41:47,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-10-25 19:41:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2020-10-25 19:41:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-10-25 19:41:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2020-10-25 19:41:47,840 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2020-10-25 19:41:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:47,841 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2020-10-25 19:41:47,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2020-10-25 19:41:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:41:47,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:47,853 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:41:48,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 19:41:48,054 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2020-10-25 19:41:48,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:41:48,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569560500] [2020-10-25 19:41:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-25 19:41:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:48,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:41:48,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:41:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:48,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:41:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:41:48,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569560500] [2020-10-25 19:41:48,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:48,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:41:48,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841832239] [2020-10-25 19:41:48,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:48,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:41:48,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:48,463 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2020-10-25 19:41:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:49,214 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2020-10-25 19:41:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:49,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-10-25 19:41:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:49,221 INFO L225 Difference]: With dead ends: 833 [2020-10-25 19:41:49,222 INFO L226 Difference]: Without dead ends: 597 [2020-10-25 19:41:49,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-25 19:41:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2020-10-25 19:41:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-25 19:41:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2020-10-25 19:41:49,295 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2020-10-25 19:41:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:49,299 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2020-10-25 19:41:49,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2020-10-25 19:41:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-25 19:41:49,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:49,310 INFO L422 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] [2020-10-25 19:41:49,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 19:41:49,515 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2020-10-25 19:41:49,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:41:49,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018582259] [2020-10-25 19:41:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-25 19:41:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:50,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:50,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:50,696 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-10-25 19:41:50,696 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:41:50,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 19:41:51,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:41:51 BoogieIcfgContainer [2020-10-25 19:41:51,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:41:51,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:41:51,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:41:51,057 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:41:51,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:46" (3/4) ... [2020-10-25 19:41:51,061 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 19:41:51,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:41:51,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:41:51,229 INFO L168 Benchmark]: Toolchain (without parser) took 8654.88 ms. Allocated memory was 50.3 MB in the beginning and 107.0 MB in the end (delta: 56.6 MB). Free memory was 25.1 MB in the beginning and 69.1 MB in the end (delta: -44.1 MB). Peak memory consumption was 50.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,230 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 39.8 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 23.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:41:51,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.50 ms. Allocated memory is still 50.3 MB. Free memory was 24.4 MB in the beginning and 24.8 MB in the end (delta: -383.8 kB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.29 ms. Allocated memory is still 50.3 MB. Free memory was 24.6 MB in the beginning and 20.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,233 INFO L168 Benchmark]: Boogie Preprocessor took 103.49 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 33.7 MB in the end (delta: -13.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,234 INFO L168 Benchmark]: RCFGBuilder took 3295.30 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 33.7 MB in the beginning and 32.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,235 INFO L168 Benchmark]: TraceAbstraction took 4065.40 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 32.0 MB in the beginning and 47.0 MB in the end (delta: -15.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,235 INFO L168 Benchmark]: Witness Printer took 170.78 ms. Allocated memory is still 107.0 MB. Free memory was 47.0 MB in the beginning and 69.1 MB in the end (delta: -22.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:51,238 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.17 ms. Allocated memory is still 39.8 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 23.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 907.50 ms. Allocated memory is still 50.3 MB. Free memory was 24.4 MB in the beginning and 24.8 MB in the end (delta: -383.8 kB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.29 ms. Allocated memory is still 50.3 MB. Free memory was 24.6 MB in the beginning and 20.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.49 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 33.7 MB in the end (delta: -13.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3295.30 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 33.7 MB in the beginning and 32.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4065.40 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 32.0 MB in the beginning and 47.0 MB in the end (delta: -15.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 16.1 GB. * Witness Printer took 170.78 ms. Allocated memory is still 107.0 MB. Free memory was 47.0 MB in the beginning and 69.1 MB in the end (delta: -22.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1353] COND FALSE !(ret <= 0) [L1358] s->hit VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1358] COND TRUE s->hit [L1359] s->state = 8656 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1363] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND TRUE s->state == 8656 [L1556] EXPR s->session [L1556] EXPR s->s3 [L1556] EXPR (s->s3)->tmp.new_cipher [L1556] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1557] COND FALSE !(! tmp___9) [L1563] ret = __VERIFIER_nondet_int() [L1564] COND TRUE blastFlag == 2 [L1565] blastFlag = 3 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1569] COND FALSE !(ret <= 0) [L1574] s->state = 8672 [L1575] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] EXPR s->s3 [L1663] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1663] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1692] skip = 0 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1237] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L3] __assert_fail("0", "s3_srvr.blast.02.i.cil-1.c", 3, "reach_error") VAL [init=1, SSLv3_server_data={-2147483617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 843 SDslu, 783 SDs, 0 SdLazy, 48 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...