./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.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.04.i.cil.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 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.04.i.cil.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 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:41:29,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:41:29,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:41:29,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:41:29,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:41:29,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:41:29,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:41:29,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:41:29,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:41:29,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:41:29,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:41:29,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:41:29,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:41:29,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:41:29,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:41:29,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:41:29,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:41:30,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:41:30,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:41:30,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:41:30,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:41:30,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:41:30,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:41:30,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:41:30,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:41:30,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:41:30,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:41:30,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:41:30,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:41:30,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:41:30,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:41:30,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:41:30,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:41:30,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:41:30,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:41:30,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:41:30,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:41:30,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:41:30,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:41:30,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:41:30,035 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:30,065 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:41:30,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:41:30,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:41:30,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:41:30,067 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:41:30,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:41:30,068 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:41:30,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:41:30,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:41:30,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:41:30,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:41:30,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:41:30,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:41:30,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:41:30,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:41:30,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:41:30,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:41:30,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:41:30,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:41:30,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:41:30,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:41:30,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:41:30,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:41:30,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:41:30,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:41:30,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:41:30,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:41:30,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:41:30,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:41:30,073 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 -> 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c [2020-10-25 19:41:30,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:41:30,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:41:30,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:41:30,490 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:41:30,491 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:41:30,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-10-25 19:41:30,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf3b6c33/5315334d803043e6a302acdcb0862cd0/FLAGa23227487 [2020-10-25 19:41:31,400 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:41:31,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-10-25 19:41:31,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf3b6c33/5315334d803043e6a302acdcb0862cd0/FLAGa23227487 [2020-10-25 19:41:31,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf3b6c33/5315334d803043e6a302acdcb0862cd0 [2020-10-25 19:41:31,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:41:31,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:41:31,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:31,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:41:31,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:41:31,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:31" (1/1) ... [2020-10-25 19:41:31,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6574c834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:31, skipping insertion in model container [2020-10-25 19:41:31,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:41:31" (1/1) ... [2020-10-25 19:41:31,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:41:31,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:41:32,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:32,172 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:41:32,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:41:32,343 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:41:32,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:32 WrapperNode [2020-10-25 19:41:32,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:41:32,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:32,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:41:32,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:41:32,358 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:32" (1/1) ... [2020-10-25 19:41:32,404 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:32" (1/1) ... [2020-10-25 19:41:32,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:41:32,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:41:32,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:41:32,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:41:32,475 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:32" (1/1) ... [2020-10-25 19:41:32,476 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:32" (1/1) ... [2020-10-25 19:41:32,487 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:32" (1/1) ... [2020-10-25 19:41:32,488 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:32" (1/1) ... [2020-10-25 19:41:32,532 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:32" (1/1) ... [2020-10-25 19:41:32,541 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:32" (1/1) ... [2020-10-25 19:41:32,546 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:32" (1/1) ... [2020-10-25 19:41:32,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:41:32,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:41:32,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:41:32,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:41:32,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:32" (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:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 19:41:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:41:32,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 19:41:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 19:41:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 19:41:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:41:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 19:41:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:41:32,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:41:33,140 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:41:33,950 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-10-25 19:41:33,951 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-10-25 19:41:33,961 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:41:33,961 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:41:33,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:33 BoogieIcfgContainer [2020-10-25 19:41:33,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:41:33,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:41:33,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:41:33,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:41:33,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:41:31" (1/3) ... [2020-10-25 19:41:33,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49613dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:33, skipping insertion in model container [2020-10-25 19:41:33,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:41:32" (2/3) ... [2020-10-25 19:41:33,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49613dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:41:33, skipping insertion in model container [2020-10-25 19:41:33,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:41:33" (3/3) ... [2020-10-25 19:41:33,972 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2020-10-25 19:41:33,984 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:41:33,990 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:41:34,004 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:41:34,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:41:34,035 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:41:34,035 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:41:34,035 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:41:34,035 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:41:34,035 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:41:34,035 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:41:34,035 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:41:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-10-25 19:41:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:41:34,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:34,066 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:34,066 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2020-10-25 19:41:34,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:34,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636053761] [2020-10-25 19:41:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:34,506 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:34,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636053761] [2020-10-25 19:41:34,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:34,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:34,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508277739] [2020-10-25 19:41:34,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:34,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:34,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:34,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:34,532 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2020-10-25 19:41:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:35,081 INFO L93 Difference]: Finished difference Result 314 states and 528 transitions. [2020-10-25 19:41:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:35,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-10-25 19:41:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:35,097 INFO L225 Difference]: With dead ends: 314 [2020-10-25 19:41:35,097 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 19:41:35,102 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,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 19:41:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-25 19:41:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2020-10-25 19:41:35,158 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2020-10-25 19:41:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:35,159 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2020-10-25 19:41:35,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2020-10-25 19:41:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-25 19:41:35,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:35,163 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:35,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:41:35,163 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2020-10-25 19:41:35,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:35,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660846004] [2020-10-25 19:41:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:35,326 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:35,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660846004] [2020-10-25 19:41:35,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:35,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:35,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787991963] [2020-10-25 19:41:35,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:35,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:35,331 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2020-10-25 19:41:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:35,799 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2020-10-25 19:41:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:35,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-10-25 19:41:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:35,801 INFO L225 Difference]: With dead ends: 280 [2020-10-25 19:41:35,801 INFO L226 Difference]: Without dead ends: 158 [2020-10-25 19:41:35,803 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,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-25 19:41:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-25 19:41:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2020-10-25 19:41:35,816 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2020-10-25 19:41:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:35,817 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2020-10-25 19:41:35,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2020-10-25 19:41:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:35,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:35,820 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:35,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:41:35,820 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:35,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:35,821 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2020-10-25 19:41:35,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:35,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651903868] [2020-10-25 19:41:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:35,990 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:35,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651903868] [2020-10-25 19:41:35,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:35,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:35,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626456991] [2020-10-25 19:41:35,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:35,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:36,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:36,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:36,001 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2020-10-25 19:41:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:36,447 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2020-10-25 19:41:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:36,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:36,450 INFO L225 Difference]: With dead ends: 279 [2020-10-25 19:41:36,450 INFO L226 Difference]: Without dead ends: 157 [2020-10-25 19:41:36,452 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,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-25 19:41:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2020-10-25 19:41:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2020-10-25 19:41:36,463 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2020-10-25 19:41:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:36,464 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2020-10-25 19:41:36,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2020-10-25 19:41:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:36,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:36,467 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:36,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:41:36,467 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2020-10-25 19:41:36,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:36,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586803488] [2020-10-25 19:41:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:36,588 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:36,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586803488] [2020-10-25 19:41:36,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:36,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:36,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775995322] [2020-10-25 19:41:36,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:36,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:36,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:36,593 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2020-10-25 19:41:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,071 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2020-10-25 19:41:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:37,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,073 INFO L225 Difference]: With dead ends: 277 [2020-10-25 19:41:37,073 INFO L226 Difference]: Without dead ends: 155 [2020-10-25 19:41:37,076 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,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-25 19:41:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2020-10-25 19:41:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2020-10-25 19:41:37,088 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2020-10-25 19:41:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,088 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2020-10-25 19:41:37,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2020-10-25 19:41:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:37,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,091 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:37,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:41:37,091 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2020-10-25 19:41:37,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096660223] [2020-10-25 19:41:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:37,187 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:37,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096660223] [2020-10-25 19:41:37,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:37,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:37,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109221159] [2020-10-25 19:41:37,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:37,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:37,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:37,191 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2020-10-25 19:41:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:37,661 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2020-10-25 19:41:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:37,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:37,664 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:37,664 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:37,664 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,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2020-10-25 19:41:37,671 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2020-10-25 19:41:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:37,672 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2020-10-25 19:41:37,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2020-10-25 19:41:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-25 19:41:37,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:37,674 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:37,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:41:37,675 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2020-10-25 19:41:37,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:37,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408855436] [2020-10-25 19:41:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:37,811 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:37,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408855436] [2020-10-25 19:41:37,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:37,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:37,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054642881] [2020-10-25 19:41:37,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:37,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:37,817 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2020-10-25 19:41:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:38,295 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2020-10-25 19:41:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:38,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-25 19:41:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:38,298 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:38,298 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:38,299 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:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2020-10-25 19:41:38,307 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2020-10-25 19:41:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:38,307 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2020-10-25 19:41:38,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2020-10-25 19:41:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-25 19:41:38,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:38,310 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:38,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:41:38,311 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2020-10-25 19:41:38,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:38,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551896839] [2020-10-25 19:41:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:38,392 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:38,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551896839] [2020-10-25 19:41:38,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:38,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:38,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747253023] [2020-10-25 19:41:38,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:38,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:38,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:38,395 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2020-10-25 19:41:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:38,829 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2020-10-25 19:41:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:38,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-25 19:41:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:38,832 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:38,833 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:38,834 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:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2020-10-25 19:41:38,843 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2020-10-25 19:41:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:38,843 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2020-10-25 19:41:38,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2020-10-25 19:41:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-25 19:41:38,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:38,845 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:38,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:41:38,846 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2020-10-25 19:41:38,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:38,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104657366] [2020-10-25 19:41:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:38,955 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:38,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104657366] [2020-10-25 19:41:38,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:38,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:38,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102273750] [2020-10-25 19:41:38,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:38,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:38,958 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2020-10-25 19:41:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:39,369 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2020-10-25 19:41:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:39,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-25 19:41:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:39,371 INFO L225 Difference]: With dead ends: 276 [2020-10-25 19:41:39,371 INFO L226 Difference]: Without dead ends: 154 [2020-10-25 19:41:39,372 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:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-25 19:41:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-10-25 19:41:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2020-10-25 19:41:39,377 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2020-10-25 19:41:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:39,377 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2020-10-25 19:41:39,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2020-10-25 19:41:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-25 19:41:39,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:39,379 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:39,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:41:39,379 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2020-10-25 19:41:39,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:39,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133600245] [2020-10-25 19:41:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:39,509 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:39,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133600245] [2020-10-25 19:41:39,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:39,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:39,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968060900] [2020-10-25 19:41:39,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:39,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:39,514 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2020-10-25 19:41:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:39,892 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2020-10-25 19:41:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:39,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-25 19:41:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:39,895 INFO L225 Difference]: With dead ends: 266 [2020-10-25 19:41:39,895 INFO L226 Difference]: Without dead ends: 144 [2020-10-25 19:41:39,898 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:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-25 19:41:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2020-10-25 19:41:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-25 19:41:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2020-10-25 19:41:39,907 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2020-10-25 19:41:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:39,907 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2020-10-25 19:41:39,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2020-10-25 19:41:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-25 19:41:39,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:39,909 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:39,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:41:39,910 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2020-10-25 19:41:39,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:39,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66436773] [2020-10-25 19:41:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:40,023 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:40,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66436773] [2020-10-25 19:41:40,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:40,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:40,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432509293] [2020-10-25 19:41:40,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:40,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:40,033 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2020-10-25 19:41:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:40,461 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2020-10-25 19:41:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:40,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-25 19:41:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:40,463 INFO L225 Difference]: With dead ends: 306 [2020-10-25 19:41:40,463 INFO L226 Difference]: Without dead ends: 184 [2020-10-25 19:41:40,464 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:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-25 19:41:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-10-25 19:41:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2020-10-25 19:41:40,471 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2020-10-25 19:41:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:40,472 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2020-10-25 19:41:40,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2020-10-25 19:41:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-25 19:41:40,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:40,473 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:40,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:41:40,473 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2020-10-25 19:41:40,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:40,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501182808] [2020-10-25 19:41:40,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:40,565 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:40,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501182808] [2020-10-25 19:41:40,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:40,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:40,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589337760] [2020-10-25 19:41:40,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:40,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:40,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:40,568 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2020-10-25 19:41:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:40,999 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2020-10-25 19:41:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:41,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-25 19:41:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:41,004 INFO L225 Difference]: With dead ends: 328 [2020-10-25 19:41:41,004 INFO L226 Difference]: Without dead ends: 184 [2020-10-25 19:41:41,005 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:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-25 19:41:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-10-25 19:41:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2020-10-25 19:41:41,015 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2020-10-25 19:41:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:41,015 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2020-10-25 19:41:41,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2020-10-25 19:41:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:41,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:41,016 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:41,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:41:41,017 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2020-10-25 19:41:41,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:41,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326660335] [2020-10-25 19:41:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:41,110 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:41,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326660335] [2020-10-25 19:41:41,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:41,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:41,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36450468] [2020-10-25 19:41:41,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:41,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:41,112 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2020-10-25 19:41:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:41,618 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2020-10-25 19:41:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:41,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:41,621 INFO L225 Difference]: With dead ends: 327 [2020-10-25 19:41:41,621 INFO L226 Difference]: Without dead ends: 183 [2020-10-25 19:41:41,622 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:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-25 19:41:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2020-10-25 19:41:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2020-10-25 19:41:41,631 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2020-10-25 19:41:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:41,631 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2020-10-25 19:41:41,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2020-10-25 19:41:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:41,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:41,633 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:41,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:41:41,633 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2020-10-25 19:41:41,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:41,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135754198] [2020-10-25 19:41:41,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:41,783 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:41,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135754198] [2020-10-25 19:41:41,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:41,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:41,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214001774] [2020-10-25 19:41:41,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:41,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:41,786 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2020-10-25 19:41:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:42,177 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2020-10-25 19:41:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:42,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:42,180 INFO L225 Difference]: With dead ends: 325 [2020-10-25 19:41:42,180 INFO L226 Difference]: Without dead ends: 181 [2020-10-25 19:41:42,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:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-25 19:41:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-10-25 19:41:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2020-10-25 19:41:42,191 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2020-10-25 19:41:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:42,192 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2020-10-25 19:41:42,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2020-10-25 19:41:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:42,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:42,194 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:42,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:41:42,194 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2020-10-25 19:41:42,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:42,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382302169] [2020-10-25 19:41:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:42,271 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:42,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382302169] [2020-10-25 19:41:42,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:42,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:42,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6182651] [2020-10-25 19:41:42,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:42,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:42,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:42,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:42,273 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2020-10-25 19:41:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:42,663 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2020-10-25 19:41:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:42,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:42,666 INFO L225 Difference]: With dead ends: 324 [2020-10-25 19:41:42,666 INFO L226 Difference]: Without dead ends: 180 [2020-10-25 19:41:42,667 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:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-25 19:41:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-10-25 19:41:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2020-10-25 19:41:42,674 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2020-10-25 19:41:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:42,674 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2020-10-25 19:41:42,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2020-10-25 19:41:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-25 19:41:42,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:42,676 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:42,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:41:42,676 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2020-10-25 19:41:42,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:42,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942538999] [2020-10-25 19:41:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:42,747 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:42,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942538999] [2020-10-25 19:41:42,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:42,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:42,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566012833] [2020-10-25 19:41:42,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:42,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:42,750 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2020-10-25 19:41:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:43,129 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2020-10-25 19:41:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:43,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-25 19:41:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:43,131 INFO L225 Difference]: With dead ends: 324 [2020-10-25 19:41:43,131 INFO L226 Difference]: Without dead ends: 180 [2020-10-25 19:41:43,132 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:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-25 19:41:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-10-25 19:41:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2020-10-25 19:41:43,143 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2020-10-25 19:41:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:43,143 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2020-10-25 19:41:43,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2020-10-25 19:41:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-25 19:41:43,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:43,145 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:43,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:41:43,145 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:43,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2020-10-25 19:41:43,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:43,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642639521] [2020-10-25 19:41:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:43,216 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:43,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642639521] [2020-10-25 19:41:43,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:43,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:43,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388359639] [2020-10-25 19:41:43,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:43,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:43,218 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2020-10-25 19:41:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:43,606 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2020-10-25 19:41:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:43,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-25 19:41:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:43,608 INFO L225 Difference]: With dead ends: 324 [2020-10-25 19:41:43,608 INFO L226 Difference]: Without dead ends: 180 [2020-10-25 19:41:43,609 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:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-25 19:41:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-10-25 19:41:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-10-25 19:41:43,616 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2020-10-25 19:41:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:43,616 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-10-25 19:41:43,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-10-25 19:41:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-25 19:41:43,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:43,617 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:43,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:41:43,618 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2020-10-25 19:41:43,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:43,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020943473] [2020-10-25 19:41:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:43,673 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:43,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020943473] [2020-10-25 19:41:43,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:43,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:43,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604962874] [2020-10-25 19:41:43,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:43,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:43,676 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2020-10-25 19:41:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:44,098 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2020-10-25 19:41:44,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:44,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-10-25 19:41:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:44,101 INFO L225 Difference]: With dead ends: 324 [2020-10-25 19:41:44,102 INFO L226 Difference]: Without dead ends: 180 [2020-10-25 19:41:44,102 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:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-25 19:41:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-10-25 19:41:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2020-10-25 19:41:44,110 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2020-10-25 19:41:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:44,110 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2020-10-25 19:41:44,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2020-10-25 19:41:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 19:41:44,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:44,112 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:44,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:41:44,112 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2020-10-25 19:41:44,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:44,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738318459] [2020-10-25 19:41:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:44,185 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:44,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738318459] [2020-10-25 19:41:44,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:44,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:44,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272427828] [2020-10-25 19:41:44,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:44,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:44,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:44,188 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2020-10-25 19:41:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:44,563 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2020-10-25 19:41:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:44,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-10-25 19:41:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:44,565 INFO L225 Difference]: With dead ends: 314 [2020-10-25 19:41:44,565 INFO L226 Difference]: Without dead ends: 170 [2020-10-25 19:41:44,566 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:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-25 19:41:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2020-10-25 19:41:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-25 19:41:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2020-10-25 19:41:44,572 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2020-10-25 19:41:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:44,573 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2020-10-25 19:41:44,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2020-10-25 19:41:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:41:44,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:44,574 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:44,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:41:44,575 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2020-10-25 19:41:44,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:44,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22755128] [2020-10-25 19:41:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:44,711 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:44,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22755128] [2020-10-25 19:41:44,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:44,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:44,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475535293] [2020-10-25 19:41:44,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:44,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:44,717 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2020-10-25 19:41:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:45,339 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2020-10-25 19:41:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:45,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-10-25 19:41:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:45,342 INFO L225 Difference]: With dead ends: 402 [2020-10-25 19:41:45,342 INFO L226 Difference]: Without dead ends: 258 [2020-10-25 19:41:45,347 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:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-10-25 19:41:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2020-10-25 19:41:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-10-25 19:41:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2020-10-25 19:41:45,358 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2020-10-25 19:41:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:45,359 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2020-10-25 19:41:45,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2020-10-25 19:41:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-25 19:41:45,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:45,360 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:45,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:41:45,361 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2020-10-25 19:41:45,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:45,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900493505] [2020-10-25 19:41:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:45,476 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:45,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900493505] [2020-10-25 19:41:45,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:45,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:45,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775654028] [2020-10-25 19:41:45,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:45,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:45,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:45,480 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2020-10-25 19:41:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:45,979 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2020-10-25 19:41:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:45,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-10-25 19:41:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:45,983 INFO L225 Difference]: With dead ends: 442 [2020-10-25 19:41:45,983 INFO L226 Difference]: Without dead ends: 255 [2020-10-25 19:41:45,984 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:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-25 19:41:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-10-25 19:41:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2020-10-25 19:41:45,995 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2020-10-25 19:41:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:45,996 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2020-10-25 19:41:45,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2020-10-25 19:41:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-25 19:41:45,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:45,998 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:45,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:41:45,998 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2020-10-25 19:41:46,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:46,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696809784] [2020-10-25 19:41:46,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:46,078 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:46,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696809784] [2020-10-25 19:41:46,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:46,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:46,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249007417] [2020-10-25 19:41:46,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:46,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:46,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:46,081 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2020-10-25 19:41:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:46,683 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2020-10-25 19:41:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:46,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-10-25 19:41:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:46,690 INFO L225 Difference]: With dead ends: 493 [2020-10-25 19:41:46,690 INFO L226 Difference]: Without dead ends: 282 [2020-10-25 19:41:46,690 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:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-25 19:41:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2020-10-25 19:41:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2020-10-25 19:41:46,699 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2020-10-25 19:41:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:46,700 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2020-10-25 19:41:46,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2020-10-25 19:41:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-25 19:41:46,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:46,701 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:46,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 19:41:46,702 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2020-10-25 19:41:46,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:46,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423533712] [2020-10-25 19:41:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:46,779 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:46,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423533712] [2020-10-25 19:41:46,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:46,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:46,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244232052] [2020-10-25 19:41:46,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:46,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:46,782 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2020-10-25 19:41:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:47,234 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2020-10-25 19:41:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:47,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-10-25 19:41:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:47,240 INFO L225 Difference]: With dead ends: 466 [2020-10-25 19:41:47,240 INFO L226 Difference]: Without dead ends: 255 [2020-10-25 19:41:47,241 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:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-25 19:41:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-10-25 19:41:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2020-10-25 19:41:47,249 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2020-10-25 19:41:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:47,250 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2020-10-25 19:41:47,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2020-10-25 19:41:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:47,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:47,251 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:47,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:41:47,251 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2020-10-25 19:41:47,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:47,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333168159] [2020-10-25 19:41:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:47,333 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:47,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333168159] [2020-10-25 19:41:47,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:47,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:47,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957864846] [2020-10-25 19:41:47,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:47,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:47,347 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2020-10-25 19:41:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:47,927 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2020-10-25 19:41:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:47,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:47,931 INFO L225 Difference]: With dead ends: 492 [2020-10-25 19:41:47,931 INFO L226 Difference]: Without dead ends: 281 [2020-10-25 19:41:47,932 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:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-25 19:41:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2020-10-25 19:41:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2020-10-25 19:41:47,939 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2020-10-25 19:41:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:47,939 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2020-10-25 19:41:47,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2020-10-25 19:41:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:47,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:47,941 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:47,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 19:41:47,941 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2020-10-25 19:41:47,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:47,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756921129] [2020-10-25 19:41:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:48,032 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:48,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756921129] [2020-10-25 19:41:48,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:48,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:48,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381026254] [2020-10-25 19:41:48,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:48,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:48,038 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2020-10-25 19:41:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:48,575 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2020-10-25 19:41:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:48,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:48,578 INFO L225 Difference]: With dead ends: 490 [2020-10-25 19:41:48,578 INFO L226 Difference]: Without dead ends: 279 [2020-10-25 19:41:48,579 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:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-10-25 19:41:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-10-25 19:41:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2020-10-25 19:41:48,586 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2020-10-25 19:41:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:48,586 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2020-10-25 19:41:48,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2020-10-25 19:41:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:48,587 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:48,588 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:48,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:41:48,588 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2020-10-25 19:41:48,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:48,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129839622] [2020-10-25 19:41:48,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:48,663 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:48,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129839622] [2020-10-25 19:41:48,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:48,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:48,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688836607] [2020-10-25 19:41:48,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:48,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:48,665 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2020-10-25 19:41:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:49,281 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2020-10-25 19:41:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:49,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:49,285 INFO L225 Difference]: With dead ends: 489 [2020-10-25 19:41:49,285 INFO L226 Difference]: Without dead ends: 278 [2020-10-25 19:41:49,286 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:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-10-25 19:41:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2020-10-25 19:41:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-25 19:41:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2020-10-25 19:41:49,292 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2020-10-25 19:41:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:49,293 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2020-10-25 19:41:49,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2020-10-25 19:41:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:49,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:49,294 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:49,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:41:49,294 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:49,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2020-10-25 19:41:49,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:49,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731618669] [2020-10-25 19:41:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:49,375 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:49,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731618669] [2020-10-25 19:41:49,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:49,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 19:41:49,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489808919] [2020-10-25 19:41:49,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 19:41:49,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:49,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 19:41:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:41:49,377 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2020-10-25 19:41:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:49,935 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2020-10-25 19:41:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 19:41:49,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-25 19:41:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:49,938 INFO L225 Difference]: With dead ends: 462 [2020-10-25 19:41:49,938 INFO L226 Difference]: Without dead ends: 251 [2020-10-25 19:41:49,939 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:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-25 19:41:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2020-10-25 19:41:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2020-10-25 19:41:49,947 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2020-10-25 19:41:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:49,947 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2020-10-25 19:41:49,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 19:41:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2020-10-25 19:41:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:49,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:49,949 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:49,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:41:49,949 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:49,949 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2020-10-25 19:41:49,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:49,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66134581] [2020-10-25 19:41:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:50,048 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:50,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66134581] [2020-10-25 19:41:50,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:50,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:50,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856163152] [2020-10-25 19:41:50,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:50,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:50,050 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2020-10-25 19:41:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:50,470 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2020-10-25 19:41:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:50,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:50,473 INFO L225 Difference]: With dead ends: 503 [2020-10-25 19:41:50,474 INFO L226 Difference]: Without dead ends: 272 [2020-10-25 19:41:50,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:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-25 19:41:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-10-25 19:41:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2020-10-25 19:41:50,483 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2020-10-25 19:41:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:50,483 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2020-10-25 19:41:50,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2020-10-25 19:41:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-25 19:41:50,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:50,484 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:50,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:41:50,485 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2020-10-25 19:41:50,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:50,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660330122] [2020-10-25 19:41:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:50,571 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:50,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660330122] [2020-10-25 19:41:50,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:50,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:50,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285182047] [2020-10-25 19:41:50,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:50,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:50,573 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2020-10-25 19:41:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:51,043 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2020-10-25 19:41:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:51,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-10-25 19:41:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:51,047 INFO L225 Difference]: With dead ends: 502 [2020-10-25 19:41:51,048 INFO L226 Difference]: Without dead ends: 271 [2020-10-25 19:41:51,049 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:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-25 19:41:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-10-25 19:41:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2020-10-25 19:41:51,060 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2020-10-25 19:41:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:51,060 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2020-10-25 19:41:51,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2020-10-25 19:41:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:41:51,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:51,062 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:51,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:41:51,062 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2020-10-25 19:41:51,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:51,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8414930] [2020-10-25 19:41:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:51,152 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:51,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8414930] [2020-10-25 19:41:51,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:51,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:51,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943827610] [2020-10-25 19:41:51,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:51,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:51,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:51,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:51,155 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2020-10-25 19:41:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:51,712 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2020-10-25 19:41:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:51,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-10-25 19:41:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:51,716 INFO L225 Difference]: With dead ends: 529 [2020-10-25 19:41:51,716 INFO L226 Difference]: Without dead ends: 298 [2020-10-25 19:41:51,716 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:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-25 19:41:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-10-25 19:41:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2020-10-25 19:41:51,726 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2020-10-25 19:41:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:51,726 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2020-10-25 19:41:51,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2020-10-25 19:41:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-25 19:41:51,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:51,727 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:51,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:41:51,727 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2020-10-25 19:41:51,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:51,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725070965] [2020-10-25 19:41:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:51,816 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:51,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725070965] [2020-10-25 19:41:51,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:51,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:51,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533225445] [2020-10-25 19:41:51,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:51,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:51,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:51,818 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2020-10-25 19:41:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:52,235 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2020-10-25 19:41:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:52,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-10-25 19:41:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:52,238 INFO L225 Difference]: With dead ends: 502 [2020-10-25 19:41:52,238 INFO L226 Difference]: Without dead ends: 271 [2020-10-25 19:41:52,239 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:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-25 19:41:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-10-25 19:41:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2020-10-25 19:41:52,248 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2020-10-25 19:41:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:52,249 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2020-10-25 19:41:52,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2020-10-25 19:41:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:41:52,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:52,250 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:52,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:41:52,250 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2020-10-25 19:41:52,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:52,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314796534] [2020-10-25 19:41:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:52,328 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:52,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314796534] [2020-10-25 19:41:52,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:52,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:52,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937420425] [2020-10-25 19:41:52,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:52,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:52,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:52,330 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2020-10-25 19:41:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:52,900 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2020-10-25 19:41:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:52,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-10-25 19:41:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:52,903 INFO L225 Difference]: With dead ends: 529 [2020-10-25 19:41:52,903 INFO L226 Difference]: Without dead ends: 298 [2020-10-25 19:41:52,904 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:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-25 19:41:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-10-25 19:41:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2020-10-25 19:41:52,913 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2020-10-25 19:41:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:52,914 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2020-10-25 19:41:52,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2020-10-25 19:41:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:41:52,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:52,915 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:52,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:41:52,915 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2020-10-25 19:41:52,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:52,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036296331] [2020-10-25 19:41:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:52,991 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:52,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036296331] [2020-10-25 19:41:52,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:52,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:52,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420018420] [2020-10-25 19:41:52,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:52,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:52,993 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2020-10-25 19:41:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:53,425 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2020-10-25 19:41:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:53,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-10-25 19:41:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:53,428 INFO L225 Difference]: With dead ends: 502 [2020-10-25 19:41:53,428 INFO L226 Difference]: Without dead ends: 271 [2020-10-25 19:41:53,429 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:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-25 19:41:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-10-25 19:41:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2020-10-25 19:41:53,438 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2020-10-25 19:41:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:53,438 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2020-10-25 19:41:53,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2020-10-25 19:41:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:41:53,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:53,439 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:53,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 19:41:53,440 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2020-10-25 19:41:53,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:53,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049439475] [2020-10-25 19:41:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:53,523 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:53,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049439475] [2020-10-25 19:41:53,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:53,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:53,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003724583] [2020-10-25 19:41:53,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:53,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:53,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:53,525 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2020-10-25 19:41:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:54,139 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2020-10-25 19:41:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:54,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-10-25 19:41:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:54,141 INFO L225 Difference]: With dead ends: 529 [2020-10-25 19:41:54,142 INFO L226 Difference]: Without dead ends: 298 [2020-10-25 19:41:54,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:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-25 19:41:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2020-10-25 19:41:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2020-10-25 19:41:54,155 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2020-10-25 19:41:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:54,156 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2020-10-25 19:41:54,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2020-10-25 19:41:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:41:54,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:54,157 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:54,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:41:54,158 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2020-10-25 19:41:54,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:54,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729492130] [2020-10-25 19:41:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:54,248 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:54,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729492130] [2020-10-25 19:41:54,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:54,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:54,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666265132] [2020-10-25 19:41:54,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:54,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:54,251 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2020-10-25 19:41:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:54,713 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2020-10-25 19:41:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:54,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-10-25 19:41:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:54,715 INFO L225 Difference]: With dead ends: 502 [2020-10-25 19:41:54,715 INFO L226 Difference]: Without dead ends: 271 [2020-10-25 19:41:54,716 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:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-25 19:41:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-10-25 19:41:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-10-25 19:41:54,725 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2020-10-25 19:41:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:54,726 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-10-25 19:41:54,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-10-25 19:41:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-25 19:41:54,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:54,727 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:54,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 19:41:54,727 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2020-10-25 19:41:54,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:54,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96670662] [2020-10-25 19:41:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:54,824 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:54,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96670662] [2020-10-25 19:41:54,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:54,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:54,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537433713] [2020-10-25 19:41:54,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:54,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:54,827 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2020-10-25 19:41:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:55,386 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2020-10-25 19:41:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:55,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-10-25 19:41:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:55,390 INFO L225 Difference]: With dead ends: 519 [2020-10-25 19:41:55,390 INFO L226 Difference]: Without dead ends: 288 [2020-10-25 19:41:55,391 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:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-25 19:41:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2020-10-25 19:41:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2020-10-25 19:41:55,401 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2020-10-25 19:41:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:55,402 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2020-10-25 19:41:55,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2020-10-25 19:41:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-25 19:41:55,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:55,403 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:55,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-25 19:41:55,405 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2020-10-25 19:41:55,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:55,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424905772] [2020-10-25 19:41:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:55,480 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:55,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424905772] [2020-10-25 19:41:55,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:55,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:55,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848543534] [2020-10-25 19:41:55,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:55,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:55,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:55,483 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2020-10-25 19:41:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:55,927 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2020-10-25 19:41:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:55,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-10-25 19:41:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:55,930 INFO L225 Difference]: With dead ends: 492 [2020-10-25 19:41:55,930 INFO L226 Difference]: Without dead ends: 261 [2020-10-25 19:41:55,930 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:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-10-25 19:41:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2020-10-25 19:41:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2020-10-25 19:41:55,940 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2020-10-25 19:41:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:55,940 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2020-10-25 19:41:55,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2020-10-25 19:41:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:55,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:55,941 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:55,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-25 19:41:55,941 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2020-10-25 19:41:55,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:55,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95185102] [2020-10-25 19:41:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:56,022 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:56,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95185102] [2020-10-25 19:41:56,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:56,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:41:56,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578983810] [2020-10-25 19:41:56,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:41:56,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:41:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:41:56,025 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2020-10-25 19:41:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:56,592 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2020-10-25 19:41:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:41:56,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-10-25 19:41:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:56,595 INFO L225 Difference]: With dead ends: 519 [2020-10-25 19:41:56,595 INFO L226 Difference]: Without dead ends: 288 [2020-10-25 19:41:56,596 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:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-25 19:41:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2020-10-25 19:41:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-25 19:41:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2020-10-25 19:41:56,606 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2020-10-25 19:41:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:56,607 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2020-10-25 19:41:56,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:41:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2020-10-25 19:41:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:56,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:56,608 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:56,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-25 19:41:56,609 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2020-10-25 19:41:56,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:56,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378224536] [2020-10-25 19:41:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:56,686 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:56,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378224536] [2020-10-25 19:41:56,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:56,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:56,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671504434] [2020-10-25 19:41:56,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:56,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:56,689 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2020-10-25 19:41:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:56,765 INFO L93 Difference]: Finished difference Result 707 states and 1055 transitions. [2020-10-25 19:41:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:56,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:41:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:56,769 INFO L225 Difference]: With dead ends: 707 [2020-10-25 19:41:56,770 INFO L226 Difference]: Without dead ends: 476 [2020-10-25 19:41:56,771 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:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2020-10-25 19:41:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2020-10-25 19:41:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2020-10-25 19:41:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 705 transitions. [2020-10-25 19:41:56,795 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 705 transitions. Word has length 106 [2020-10-25 19:41:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:56,796 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 705 transitions. [2020-10-25 19:41:56,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 705 transitions. [2020-10-25 19:41:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:56,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:56,798 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:56,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-25 19:41:56,799 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580761, now seen corresponding path program 1 times [2020-10-25 19:41:56,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:56,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542242559] [2020-10-25 19:41:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:56,854 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:56,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542242559] [2020-10-25 19:41:56,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:56,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:56,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966479003] [2020-10-25 19:41:56,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:56,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:56,857 INFO L87 Difference]: Start difference. First operand 476 states and 705 transitions. Second operand 3 states. [2020-10-25 19:41:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:56,913 INFO L93 Difference]: Finished difference Result 960 states and 1425 transitions. [2020-10-25 19:41:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:56,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:41:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:56,917 INFO L225 Difference]: With dead ends: 960 [2020-10-25 19:41:56,918 INFO L226 Difference]: Without dead ends: 503 [2020-10-25 19:41:56,919 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:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2020-10-25 19:41:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2020-10-25 19:41:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-25 19:41:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 740 transitions. [2020-10-25 19:41:56,936 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 740 transitions. Word has length 106 [2020-10-25 19:41:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:56,936 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 740 transitions. [2020-10-25 19:41:56,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 740 transitions. [2020-10-25 19:41:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 19:41:56,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:56,939 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:56,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-25 19:41:56,939 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 555304539, now seen corresponding path program 1 times [2020-10-25 19:41:56,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:56,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613725722] [2020-10-25 19:41:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:41:56,984 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:56,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613725722] [2020-10-25 19:41:56,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:41:56,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:41:56,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841858707] [2020-10-25 19:41:56,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:41:56,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:41:56,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:41:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:41:56,986 INFO L87 Difference]: Start difference. First operand 503 states and 740 transitions. Second operand 3 states. [2020-10-25 19:41:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:41:57,015 INFO L93 Difference]: Finished difference Result 989 states and 1461 transitions. [2020-10-25 19:41:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:41:57,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 19:41:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:41:57,019 INFO L225 Difference]: With dead ends: 989 [2020-10-25 19:41:57,019 INFO L226 Difference]: Without dead ends: 505 [2020-10-25 19:41:57,020 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:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-10-25 19:41:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2020-10-25 19:41:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2020-10-25 19:41:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 742 transitions. [2020-10-25 19:41:57,040 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 742 transitions. Word has length 106 [2020-10-25 19:41:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:41:57,040 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 742 transitions. [2020-10-25 19:41:57,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:41:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 742 transitions. [2020-10-25 19:41:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-25 19:41:57,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:41:57,043 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:57,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-25 19:41:57,043 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:41:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:41:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2020-10-25 19:41:57,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:41:57,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469330318] [2020-10-25 19:41:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:41:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:57,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:41:57,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:41:57,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 19:41:57,378 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:41:57,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-25 19:41:57,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:41:57 BoogieIcfgContainer [2020-10-25 19:41:57,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:41:57,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:41:57,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:41:57,546 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:41:57,547 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:33" (3/4) ... [2020-10-25 19:41:57,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 19:41:57,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:41:57,553 INFO L168 Benchmark]: Toolchain (without parser) took 25963.60 ms. Allocated memory was 56.6 MB in the beginning and 201.3 MB in the end (delta: 144.7 MB). Free memory was 39.9 MB in the beginning and 132.4 MB in the end (delta: -92.6 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,554 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 44.0 MB. Free memory is still 23.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:41:57,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.49 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 33.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.40 ms. Allocated memory is still 56.6 MB. Free memory was 33.1 MB in the beginning and 28.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,557 INFO L168 Benchmark]: Boogie Preprocessor took 87.55 ms. Allocated memory is still 56.6 MB. Free memory was 28.6 MB in the beginning and 21.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,557 INFO L168 Benchmark]: RCFGBuilder took 1409.75 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 21.7 MB in the beginning and 36.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,558 INFO L168 Benchmark]: TraceAbstraction took 23580.52 ms. Allocated memory was 73.4 MB in the beginning and 201.3 MB in the end (delta: 127.9 MB). Free memory was 36.0 MB in the beginning and 132.4 MB in the end (delta: -96.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:41:57,558 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 201.3 MB. Free memory is still 132.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:41:57,560 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.20 ms. Allocated memory is still 44.0 MB. Free memory is still 23.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 747.49 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 33.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 119.40 ms. Allocated memory is still 56.6 MB. Free memory was 33.1 MB in the beginning and 28.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.55 ms. Allocated memory is still 56.6 MB. Free memory was 28.6 MB in the beginning and 21.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1409.75 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 21.7 MB in the beginning and 36.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23580.52 ms. Allocated memory was 73.4 MB in the beginning and 201.3 MB in the end (delta: 127.9 MB). Free memory was 36.0 MB in the beginning and 132.4 MB in the end (delta: -96.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.46 ms. Allocated memory is still 201.3 MB. Free memory is still 132.4 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}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] 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 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] COND FALSE !(! tmp___9) [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 2 [L1561] blastFlag = 4 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 == 4 VAL [init=1, SSLv3_server_data={6:0}] [L3] __assert_fail("0", "s3_srvr.blast.04.i.cil.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: 23.3s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7516 SDtfs, 2089 SDslu, 10975 SDs, 0 SdLazy, 6884 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred 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, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 763149 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:42:00,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:42:00,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:42:00,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:42:00,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:42:00,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:42:00,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:42:00,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:42:00,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:42:00,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:42:00,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:42:00,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:42:00,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:42:00,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:42:00,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:42:00,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:42:00,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:42:00,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:42:00,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:42:00,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:42:00,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:42:00,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:42:00,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:42:00,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:42:00,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:42:00,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:42:00,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:42:00,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:42:00,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:42:00,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:42:00,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:42:00,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:42:00,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:42:00,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:42:00,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:42:00,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:42:00,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:42:00,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:42:00,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:42:00,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:42:00,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:42:00,478 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:42:00,543 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:42:00,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:42:00,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:42:00,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:42:00,546 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:42:00,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:42:00,547 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:42:00,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:42:00,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:42:00,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:42:00,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:42:00,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:42:00,548 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 19:42:00,548 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 19:42:00,549 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:42:00,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:42:00,549 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:42:00,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:42:00,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:42:00,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:42:00,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:42:00,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:42:00,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:42:00,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:42:00,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:42:00,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:42:00,552 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 19:42:00,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 19:42:00,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:42:00,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:42:00,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 19:42:00,553 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 -> 3ff34e80d9f0f73b7bbd7bbe2f389b5cf58f461c [2020-10-25 19:42:00,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:42:00,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:42:00,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:42:00,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:42:00,986 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:42:00,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-10-25 19:42:01,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e770775f3/72b7b2289b4445de9cd079793a1ead5d/FLAG8affb38a0 [2020-10-25 19:42:01,892 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:42:01,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2020-10-25 19:42:01,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e770775f3/72b7b2289b4445de9cd079793a1ead5d/FLAG8affb38a0 [2020-10-25 19:42:02,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e770775f3/72b7b2289b4445de9cd079793a1ead5d [2020-10-25 19:42:02,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:42:02,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:42:02,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:42:02,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:42:02,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:42:02,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:42:02" (1/1) ... [2020-10-25 19:42:02,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ebe6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:02, skipping insertion in model container [2020-10-25 19:42:02,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:42:02" (1/1) ... [2020-10-25 19:42:02,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:42:02,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:42:02,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:42:02,816 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:42:03,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:42:03,061 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:42:03,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03 WrapperNode [2020-10-25 19:42:03,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:42:03,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:42:03,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:42:03,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:42:03,075 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:42:03" (1/1) ... [2020-10-25 19:42:03,107 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:42:03" (1/1) ... [2020-10-25 19:42:03,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:42:03,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:42:03,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:42:03,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:42:03,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (1/1) ... [2020-10-25 19:42:03,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:42:03,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:42:03,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:42:03,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:42:03,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (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:42:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 19:42:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 19:42:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:42:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 19:42:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 19:42:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 19:42:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:42:03,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:42:03,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-10-25 19:42:03,832 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:42:06,442 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-10-25 19:42:06,443 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-10-25 19:42:06,454 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:42:06,454 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:42:06,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:42:06 BoogieIcfgContainer [2020-10-25 19:42:06,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:42:06,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:42:06,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:42:06,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:42:06,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:42:02" (1/3) ... [2020-10-25 19:42:06,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779f300c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:42:06, skipping insertion in model container [2020-10-25 19:42:06,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:42:03" (2/3) ... [2020-10-25 19:42:06,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779f300c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:42:06, skipping insertion in model container [2020-10-25 19:42:06,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:42:06" (3/3) ... [2020-10-25 19:42:06,467 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2020-10-25 19:42:06,479 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:42:06,486 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:42:06,502 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:42:06,532 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:42:06,532 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:42:06,532 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:42:06,533 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:42:06,533 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:42:06,533 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:42:06,533 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:42:06,534 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:42:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-10-25 19:42:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:42:06,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:42:06,563 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:42:06,564 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:42:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:42:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2020-10-25 19:42:06,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:42:06,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604515584] [2020-10-25 19:42:06,584 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:42:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:42:06,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:42:06,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:42:07,024 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:42:07,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:42:07,063 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:42:07,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604515584] [2020-10-25 19:42:07,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:42:07,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:42:07,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353679824] [2020-10-25 19:42:07,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:42:07,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:42:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:42:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:42:07,101 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2020-10-25 19:42:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:42:07,310 INFO L93 Difference]: Finished difference Result 541 states and 918 transitions. [2020-10-25 19:42:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:42:07,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-10-25 19:42:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:42:07,344 INFO L225 Difference]: With dead ends: 541 [2020-10-25 19:42:07,344 INFO L226 Difference]: Without dead ends: 366 [2020-10-25 19:42:07,350 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:42:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2020-10-25 19:42:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2020-10-25 19:42:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-10-25 19:42:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2020-10-25 19:42:07,491 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2020-10-25 19:42:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:42:07,491 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2020-10-25 19:42:07,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:42:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2020-10-25 19:42:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-25 19:42:07,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:42:07,498 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:42:07,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 19:42:07,712 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:42:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:42:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2020-10-25 19:42:07,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:42:07,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526304715] [2020-10-25 19:42:07,716 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:42:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:42:08,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:42:08,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:42:08,121 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:42:08,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:42:08,185 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:42:08,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526304715] [2020-10-25 19:42:08,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:42:08,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:42:08,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149748954] [2020-10-25 19:42:08,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:42:08,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:42:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:42:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:42:08,194 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2020-10-25 19:42:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:42:08,710 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2020-10-25 19:42:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:42:08,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-10-25 19:42:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:42:08,719 INFO L225 Difference]: With dead ends: 839 [2020-10-25 19:42:08,719 INFO L226 Difference]: Without dead ends: 600 [2020-10-25 19:42:08,724 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:42:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-10-25 19:42:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2020-10-25 19:42:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-25 19:42:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2020-10-25 19:42:08,807 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2020-10-25 19:42:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:42:08,809 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2020-10-25 19:42:08,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:42:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2020-10-25 19:42:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-25 19:42:08,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:42:08,827 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:42:09,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 19:42:09,046 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:42:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:42:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2020-10-25 19:42:09,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:42:09,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823254470] [2020-10-25 19:42:09,049 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:42:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:42:09,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:42:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:42:10,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:42:10,414 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-10-25 19:42:10,422 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:42:10,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 19:42:10,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:42:10 BoogieIcfgContainer [2020-10-25 19:42:10,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:42:10,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:42:10,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:42:10,827 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:42:10,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:42:06" (3/4) ... [2020-10-25 19:42:10,830 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 19:42:10,990 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:42:10,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:42:10,993 INFO L168 Benchmark]: Toolchain (without parser) took 8908.12 ms. Allocated memory was 48.2 MB in the beginning and 119.5 MB in the end (delta: 71.3 MB). Free memory was 23.5 MB in the beginning and 79.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,994 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 48.2 MB. Free memory was 32.7 MB in the beginning and 32.7 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:42:10,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 970.34 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 22.8 MB in the beginning and 32.1 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.57 ms. Allocated memory is still 60.8 MB. Free memory was 32.1 MB in the beginning and 27.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,996 INFO L168 Benchmark]: Boogie Preprocessor took 130.01 ms. Allocated memory is still 60.8 MB. Free memory was 27.7 MB in the beginning and 32.1 MB in the end (delta: -4.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,997 INFO L168 Benchmark]: RCFGBuilder took 3115.24 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 31.9 MB in the beginning and 52.4 MB in the end (delta: -20.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,997 INFO L168 Benchmark]: TraceAbstraction took 4367.50 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 51.9 MB in the beginning and 34.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 47.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:10,998 INFO L168 Benchmark]: Witness Printer took 164.26 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 34.3 MB in the beginning and 79.2 MB in the end (delta: -44.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:42:11,001 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.22 ms. Allocated memory is still 48.2 MB. Free memory was 32.7 MB in the beginning and 32.7 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 970.34 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 22.8 MB in the beginning and 32.1 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 144.57 ms. Allocated memory is still 60.8 MB. Free memory was 32.1 MB in the beginning and 27.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 130.01 ms. Allocated memory is still 60.8 MB. Free memory was 27.7 MB in the beginning and 32.1 MB in the end (delta: -4.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3115.24 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 31.9 MB in the beginning and 52.4 MB in the end (delta: -20.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4367.50 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 51.9 MB in the beginning and 34.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 47.2 MB. Max. memory is 16.1 GB. * Witness Printer took 164.26 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 34.3 MB in the beginning and 79.2 MB in the end (delta: -44.9 MB). Peak memory consumption was 11.4 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}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L1359] 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 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] COND FALSE !(! tmp___9) [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 2 [L1561] blastFlag = 4 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 == 4 VAL [init=1, SSLv3_server_data={-2147483617:0}] [L3] __assert_fail("0", "s3_srvr.blast.04.i.cil.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: 4.1s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 845 SDslu, 786 SDs, 0 SdLazy, 48 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred 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.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.3s 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...