./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 19:00:42,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:00:42,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:00:42,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:00:42,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:00:42,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:00:42,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:00:42,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:00:42,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:00:42,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:00:42,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:00:42,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:00:42,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:00:42,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:00:42,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:00:42,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:00:42,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:00:42,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:00:42,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:00:42,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:00:42,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:00:42,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:00:42,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:00:42,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:00:42,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:00:42,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:00:42,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:00:42,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:00:42,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:00:42,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:00:42,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:00:42,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:00:42,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:00:42,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:00:42,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:00:42,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:00:42,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:00:42,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:00:42,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:00:42,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:00:42,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:00:42,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:00:42,538 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:00:42,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:00:42,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:00:42,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:00:42,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:00:42,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:00:42,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:00:42,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:00:42,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:00:42,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:00:42,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:00:42,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:00:42,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:00:42,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer 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(__VERIFIER_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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-12-07 19:00:42,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:00:42,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:00:42,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:00:42,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:00:42,656 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:00:42,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:00:42,694 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/7b8976fb7/cbc3fdf53ba545fbb61285d511297b33/FLAGc5ca44c0e [2019-12-07 19:00:43,215 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:00:43,216 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:00:43,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/7b8976fb7/cbc3fdf53ba545fbb61285d511297b33/FLAGc5ca44c0e [2019-12-07 19:00:43,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/7b8976fb7/cbc3fdf53ba545fbb61285d511297b33 [2019-12-07 19:00:43,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:00:43,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:00:43,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:43,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:00:43,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:00:43,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:43" (1/1) ... [2019-12-07 19:00:43,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247cc663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:43, skipping insertion in model container [2019-12-07 19:00:43,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:43" (1/1) ... [2019-12-07 19:00:43,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:00:43,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:00:44,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:44,092 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:00:44,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:44,168 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:00:44,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44 WrapperNode [2019-12-07 19:00:44,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:44,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:44,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:00:44,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:00:44,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:44,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:00:44,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:00:44,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:00:44,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... [2019-12-07 19:00:44,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:00:44,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:00:44,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:00:44,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:00:44,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/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 [2019-12-07 19:00:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:00:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:00:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:00:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:00:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:00:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:00:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:00:44,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:00:44,459 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:00:44,948 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 19:00:44,948 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 19:00:44,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:00:44,949 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 19:00:44,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:44 BoogieIcfgContainer [2019-12-07 19:00:44,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:00:44,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:00:44,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:00:44,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:00:44,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:00:43" (1/3) ... [2019-12-07 19:00:44,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b26a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:44, skipping insertion in model container [2019-12-07 19:00:44,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:44" (2/3) ... [2019-12-07 19:00:44,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b26a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:44, skipping insertion in model container [2019-12-07 19:00:44,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:44" (3/3) ... [2019-12-07 19:00:44,955 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:00:44,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:00:44,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:00:44,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:00:44,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:00:44,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:00:44,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:00:44,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:00:44,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:00:44,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:00:44,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:00:44,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:00:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 19:00:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:00:45,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:45,011 INFO L410 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] [2019-12-07 19:00:45,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-12-07 19:00:45,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:45,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758293469] [2019-12-07 19:00:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:45,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758293469] [2019-12-07 19:00:45,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:45,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:45,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130582692] [2019-12-07 19:00:45,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:45,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:45,249 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-12-07 19:00:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:45,536 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-12-07 19:00:45,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:45,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 19:00:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:45,548 INFO L225 Difference]: With dead ends: 317 [2019-12-07 19:00:45,549 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 19:00:45,552 INFO L630 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 [2019-12-07 19:00:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 19:00:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-12-07 19:00:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-12-07 19:00:45,591 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-12-07 19:00:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:45,591 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-12-07 19:00:45,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-12-07 19:00:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 19:00:45,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:45,593 INFO L410 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] [2019-12-07 19:00:45,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-12-07 19:00:45,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:45,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792594660] [2019-12-07 19:00:45,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:45,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792594660] [2019-12-07 19:00:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:45,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:45,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100577895] [2019-12-07 19:00:45,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:45,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:45,688 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-12-07 19:00:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:45,920 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-12-07 19:00:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:45,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 19:00:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:45,922 INFO L225 Difference]: With dead ends: 284 [2019-12-07 19:00:45,922 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 19:00:45,923 INFO L630 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 [2019-12-07 19:00:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 19:00:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-12-07 19:00:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-12-07 19:00:45,932 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-12-07 19:00:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:45,932 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-12-07 19:00:45,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-12-07 19:00:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 19:00:45,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:45,934 INFO L410 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] [2019-12-07 19:00:45,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-12-07 19:00:45,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:45,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220445279] [2019-12-07 19:00:45,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:46,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220445279] [2019-12-07 19:00:46,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:46,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:46,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413269910] [2019-12-07 19:00:46,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:46,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:46,013 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-12-07 19:00:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:46,210 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-12-07 19:00:46,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:46,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 19:00:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:46,211 INFO L225 Difference]: With dead ends: 282 [2019-12-07 19:00:46,211 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 19:00:46,212 INFO L630 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 [2019-12-07 19:00:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 19:00:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-12-07 19:00:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-12-07 19:00:46,219 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-12-07 19:00:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:46,219 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-12-07 19:00:46,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-12-07 19:00:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 19:00:46,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:46,221 INFO L410 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] [2019-12-07 19:00:46,221 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-12-07 19:00:46,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:46,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941918062] [2019-12-07 19:00:46,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:46,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941918062] [2019-12-07 19:00:46,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:46,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:46,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414961888] [2019-12-07 19:00:46,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:46,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:46,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:46,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:46,274 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-12-07 19:00:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:46,482 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-12-07 19:00:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:46,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 19:00:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:46,484 INFO L225 Difference]: With dead ends: 281 [2019-12-07 19:00:46,484 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 19:00:46,484 INFO L630 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 [2019-12-07 19:00:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 19:00:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-12-07 19:00:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-12-07 19:00:46,491 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-12-07 19:00:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:46,491 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-12-07 19:00:46,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-12-07 19:00:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 19:00:46,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:46,492 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:46,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-12-07 19:00:46,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:46,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796554879] [2019-12-07 19:00:46,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:46,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796554879] [2019-12-07 19:00:46,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:46,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:46,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445727226] [2019-12-07 19:00:46,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:46,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:46,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:46,536 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-12-07 19:00:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:46,731 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-12-07 19:00:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:46,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 19:00:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:46,732 INFO L225 Difference]: With dead ends: 280 [2019-12-07 19:00:46,732 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 19:00:46,733 INFO L630 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 [2019-12-07 19:00:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 19:00:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 19:00:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-12-07 19:00:46,738 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-12-07 19:00:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-12-07 19:00:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-12-07 19:00:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 19:00:46,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:46,738 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:46,739 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:46,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-12-07 19:00:46,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:46,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990283304] [2019-12-07 19:00:46,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:46,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990283304] [2019-12-07 19:00:46,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:46,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:46,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566996312] [2019-12-07 19:00:46,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:46,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:46,787 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-12-07 19:00:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:46,963 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-12-07 19:00:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:46,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 19:00:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:46,965 INFO L225 Difference]: With dead ends: 280 [2019-12-07 19:00:46,965 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 19:00:46,965 INFO L630 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 [2019-12-07 19:00:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 19:00:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 19:00:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-12-07 19:00:46,969 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-12-07 19:00:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:46,969 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-12-07 19:00:46,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-12-07 19:00:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 19:00:46,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:46,970 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:46,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:46,971 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-12-07 19:00:46,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:46,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515199006] [2019-12-07 19:00:46,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:47,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515199006] [2019-12-07 19:00:47,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:47,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:47,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114329297] [2019-12-07 19:00:47,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:47,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:47,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:47,018 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-12-07 19:00:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:47,203 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-12-07 19:00:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:47,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 19:00:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:47,205 INFO L225 Difference]: With dead ends: 280 [2019-12-07 19:00:47,205 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 19:00:47,205 INFO L630 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 [2019-12-07 19:00:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 19:00:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 19:00:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-12-07 19:00:47,208 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-12-07 19:00:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:47,209 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-12-07 19:00:47,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-12-07 19:00:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 19:00:47,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:47,209 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:47,210 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:47,210 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-12-07 19:00:47,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:47,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641009537] [2019-12-07 19:00:47,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:47,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641009537] [2019-12-07 19:00:47,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:47,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:47,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124895877] [2019-12-07 19:00:47,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:47,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:47,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:47,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:47,251 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-12-07 19:00:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:47,480 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-12-07 19:00:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:47,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 19:00:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:47,481 INFO L225 Difference]: With dead ends: 280 [2019-12-07 19:00:47,481 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 19:00:47,481 INFO L630 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 [2019-12-07 19:00:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 19:00:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 19:00:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 19:00:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-12-07 19:00:47,485 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-12-07 19:00:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:47,485 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-12-07 19:00:47,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-12-07 19:00:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 19:00:47,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:47,486 INFO L410 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] [2019-12-07 19:00:47,486 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-12-07 19:00:47,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:47,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051909493] [2019-12-07 19:00:47,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:47,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051909493] [2019-12-07 19:00:47,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:47,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:47,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040683494] [2019-12-07 19:00:47,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:47,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:47,519 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-12-07 19:00:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:47,720 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-12-07 19:00:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:47,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 19:00:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:47,722 INFO L225 Difference]: With dead ends: 310 [2019-12-07 19:00:47,722 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 19:00:47,722 INFO L630 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 [2019-12-07 19:00:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 19:00:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-12-07 19:00:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-12-07 19:00:47,727 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-12-07 19:00:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:47,728 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-12-07 19:00:47,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-12-07 19:00:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 19:00:47,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:47,729 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:47,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-12-07 19:00:47,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:47,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243419504] [2019-12-07 19:00:47,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:47,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243419504] [2019-12-07 19:00:47,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:47,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:47,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243305149] [2019-12-07 19:00:47,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:47,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:47,768 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-12-07 19:00:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:47,941 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-12-07 19:00:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:47,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 19:00:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:47,942 INFO L225 Difference]: With dead ends: 314 [2019-12-07 19:00:47,942 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 19:00:47,943 INFO L630 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 [2019-12-07 19:00:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 19:00:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-12-07 19:00:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-12-07 19:00:47,946 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-12-07 19:00:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:47,946 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-12-07 19:00:47,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-12-07 19:00:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 19:00:47,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:47,947 INFO L410 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] [2019-12-07 19:00:47,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-12-07 19:00:47,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:47,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723328509] [2019-12-07 19:00:47,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:47,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723328509] [2019-12-07 19:00:47,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:47,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:47,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864798665] [2019-12-07 19:00:47,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:47,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:47,980 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-12-07 19:00:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:48,201 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-12-07 19:00:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:48,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 19:00:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:48,203 INFO L225 Difference]: With dead ends: 332 [2019-12-07 19:00:48,203 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 19:00:48,203 INFO L630 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 [2019-12-07 19:00:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 19:00:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-12-07 19:00:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-12-07 19:00:48,206 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-12-07 19:00:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:48,207 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-12-07 19:00:48,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-12-07 19:00:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 19:00:48,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:48,207 INFO L410 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] [2019-12-07 19:00:48,207 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-12-07 19:00:48,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:48,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987205552] [2019-12-07 19:00:48,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:48,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987205552] [2019-12-07 19:00:48,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:48,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:48,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592877516] [2019-12-07 19:00:48,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:48,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:48,240 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-12-07 19:00:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:48,448 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-12-07 19:00:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:48,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 19:00:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:48,450 INFO L225 Difference]: With dead ends: 330 [2019-12-07 19:00:48,450 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 19:00:48,450 INFO L630 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 [2019-12-07 19:00:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 19:00:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-12-07 19:00:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-12-07 19:00:48,454 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-12-07 19:00:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:48,454 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-12-07 19:00:48,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-12-07 19:00:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 19:00:48,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:48,455 INFO L410 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] [2019-12-07 19:00:48,455 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-12-07 19:00:48,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:48,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166443981] [2019-12-07 19:00:48,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:48,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166443981] [2019-12-07 19:00:48,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:48,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:48,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096492714] [2019-12-07 19:00:48,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:48,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:48,487 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-12-07 19:00:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:48,702 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-12-07 19:00:48,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:48,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 19:00:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:48,704 INFO L225 Difference]: With dead ends: 329 [2019-12-07 19:00:48,704 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 19:00:48,704 INFO L630 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 [2019-12-07 19:00:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 19:00:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-12-07 19:00:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-12-07 19:00:48,708 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-12-07 19:00:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:48,708 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-12-07 19:00:48,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-12-07 19:00:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 19:00:48,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:48,709 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:48,709 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-12-07 19:00:48,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:48,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922378960] [2019-12-07 19:00:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:48,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922378960] [2019-12-07 19:00:48,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:48,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:48,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075866646] [2019-12-07 19:00:48,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:48,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:48,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:48,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:48,742 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-12-07 19:00:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:48,966 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-12-07 19:00:48,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:48,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 19:00:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:48,967 INFO L225 Difference]: With dead ends: 328 [2019-12-07 19:00:48,967 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 19:00:48,967 INFO L630 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 [2019-12-07 19:00:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 19:00:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 19:00:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-12-07 19:00:48,971 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-12-07 19:00:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:48,971 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-12-07 19:00:48,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-12-07 19:00:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 19:00:48,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:48,972 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:48,972 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-12-07 19:00:48,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:48,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226870694] [2019-12-07 19:00:48,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:49,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226870694] [2019-12-07 19:00:49,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:49,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:49,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931448975] [2019-12-07 19:00:49,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:49,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:49,008 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-12-07 19:00:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:49,226 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-12-07 19:00:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:49,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 19:00:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:49,227 INFO L225 Difference]: With dead ends: 328 [2019-12-07 19:00:49,227 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 19:00:49,228 INFO L630 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 [2019-12-07 19:00:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 19:00:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 19:00:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-12-07 19:00:49,231 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-12-07 19:00:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:49,231 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-12-07 19:00:49,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-12-07 19:00:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 19:00:49,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:49,232 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:49,232 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-12-07 19:00:49,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:49,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247945822] [2019-12-07 19:00:49,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:49,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247945822] [2019-12-07 19:00:49,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:49,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:49,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231898164] [2019-12-07 19:00:49,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:49,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:49,261 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-12-07 19:00:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:49,452 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-12-07 19:00:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:49,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 19:00:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:49,454 INFO L225 Difference]: With dead ends: 328 [2019-12-07 19:00:49,454 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 19:00:49,454 INFO L630 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 [2019-12-07 19:00:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 19:00:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 19:00:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-12-07 19:00:49,457 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-12-07 19:00:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:49,457 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-12-07 19:00:49,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-12-07 19:00:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 19:00:49,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:49,458 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:49,458 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:49,458 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-12-07 19:00:49,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:49,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537460293] [2019-12-07 19:00:49,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:49,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537460293] [2019-12-07 19:00:49,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:49,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:49,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180492503] [2019-12-07 19:00:49,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:49,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:49,487 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-12-07 19:00:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:49,670 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-12-07 19:00:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:49,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 19:00:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:49,671 INFO L225 Difference]: With dead ends: 328 [2019-12-07 19:00:49,671 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 19:00:49,672 INFO L630 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 [2019-12-07 19:00:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 19:00:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 19:00:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-12-07 19:00:49,675 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-12-07 19:00:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:49,675 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-12-07 19:00:49,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-12-07 19:00:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 19:00:49,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:49,675 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:49,676 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-12-07 19:00:49,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:49,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388844033] [2019-12-07 19:00:49,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:49,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388844033] [2019-12-07 19:00:49,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:49,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:49,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531660999] [2019-12-07 19:00:49,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:49,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:49,706 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-12-07 19:00:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:49,913 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-12-07 19:00:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:49,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 19:00:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:49,914 INFO L225 Difference]: With dead ends: 318 [2019-12-07 19:00:49,914 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 19:00:49,914 INFO L630 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 [2019-12-07 19:00:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 19:00:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-12-07 19:00:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 19:00:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-12-07 19:00:49,918 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-12-07 19:00:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:49,918 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-12-07 19:00:49,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-12-07 19:00:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 19:00:49,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:49,918 INFO L410 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] [2019-12-07 19:00:49,918 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-12-07 19:00:49,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:49,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765542358] [2019-12-07 19:00:49,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:49,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765542358] [2019-12-07 19:00:49,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:49,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:49,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112806494] [2019-12-07 19:00:49,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:49,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:49,969 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-12-07 19:00:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:50,243 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-12-07 19:00:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:50,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 19:00:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:50,245 INFO L225 Difference]: With dead ends: 408 [2019-12-07 19:00:50,245 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 19:00:50,245 INFO L630 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 [2019-12-07 19:00:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 19:00:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-12-07 19:00:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 19:00:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-12-07 19:00:50,250 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-12-07 19:00:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:50,250 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-12-07 19:00:50,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-12-07 19:00:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 19:00:50,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:50,251 INFO L410 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] [2019-12-07 19:00:50,251 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-12-07 19:00:50,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:50,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19162748] [2019-12-07 19:00:50,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:50,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19162748] [2019-12-07 19:00:50,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:50,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:50,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833960165] [2019-12-07 19:00:50,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:50,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:50,295 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-12-07 19:00:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:50,550 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-12-07 19:00:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:50,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 19:00:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:50,551 INFO L225 Difference]: With dead ends: 446 [2019-12-07 19:00:50,551 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 19:00:50,552 INFO L630 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 [2019-12-07 19:00:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 19:00:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-12-07 19:00:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-12-07 19:00:50,555 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-12-07 19:00:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:50,555 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-12-07 19:00:50,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-12-07 19:00:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 19:00:50,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:50,556 INFO L410 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] [2019-12-07 19:00:50,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-12-07 19:00:50,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:50,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076758379] [2019-12-07 19:00:50,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:50,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076758379] [2019-12-07 19:00:50,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:50,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:50,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281016201] [2019-12-07 19:00:50,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:50,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:50,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:50,595 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-12-07 19:00:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:50,872 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-12-07 19:00:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:50,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 19:00:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:50,873 INFO L225 Difference]: With dead ends: 499 [2019-12-07 19:00:50,873 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 19:00:50,874 INFO L630 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 [2019-12-07 19:00:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 19:00:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-12-07 19:00:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-12-07 19:00:50,877 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-12-07 19:00:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:50,877 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-12-07 19:00:50,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-12-07 19:00:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 19:00:50,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:50,878 INFO L410 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] [2019-12-07 19:00:50,878 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-12-07 19:00:50,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:50,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31580628] [2019-12-07 19:00:50,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:50,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31580628] [2019-12-07 19:00:50,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:50,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:50,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695864922] [2019-12-07 19:00:50,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:50,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:50,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:50,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:50,913 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-12-07 19:00:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:51,135 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-12-07 19:00:51,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:51,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 19:00:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:51,137 INFO L225 Difference]: With dead ends: 470 [2019-12-07 19:00:51,137 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 19:00:51,137 INFO L630 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 [2019-12-07 19:00:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 19:00:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-12-07 19:00:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-12-07 19:00:51,141 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-12-07 19:00:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:51,141 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-12-07 19:00:51,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-12-07 19:00:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 19:00:51,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:51,142 INFO L410 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] [2019-12-07 19:00:51,142 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-12-07 19:00:51,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:51,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464581870] [2019-12-07 19:00:51,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464581870] [2019-12-07 19:00:51,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:51,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:51,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73778183] [2019-12-07 19:00:51,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:51,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:51,176 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-12-07 19:00:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:51,448 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-12-07 19:00:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:51,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 19:00:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:51,449 INFO L225 Difference]: With dead ends: 497 [2019-12-07 19:00:51,449 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 19:00:51,450 INFO L630 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 [2019-12-07 19:00:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 19:00:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-12-07 19:00:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-12-07 19:00:51,453 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-12-07 19:00:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:51,453 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-12-07 19:00:51,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-12-07 19:00:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 19:00:51,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:51,454 INFO L410 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] [2019-12-07 19:00:51,454 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-12-07 19:00:51,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:51,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177506345] [2019-12-07 19:00:51,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:51,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177506345] [2019-12-07 19:00:51,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:51,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:51,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934472184] [2019-12-07 19:00:51,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:51,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:51,491 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-12-07 19:00:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:51,909 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-12-07 19:00:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:51,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 19:00:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:51,914 INFO L225 Difference]: With dead ends: 496 [2019-12-07 19:00:51,914 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 19:00:51,915 INFO L630 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 [2019-12-07 19:00:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 19:00:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-12-07 19:00:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-12-07 19:00:51,925 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-12-07 19:00:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:51,925 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-12-07 19:00:51,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-12-07 19:00:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 19:00:51,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:51,927 INFO L410 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] [2019-12-07 19:00:51,927 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-12-07 19:00:51,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:51,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148676481] [2019-12-07 19:00:51,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:51,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148676481] [2019-12-07 19:00:51,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:51,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:51,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47579559] [2019-12-07 19:00:51,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:51,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:51,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:51,979 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-12-07 19:00:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:52,196 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-12-07 19:00:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:52,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 19:00:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:52,198 INFO L225 Difference]: With dead ends: 468 [2019-12-07 19:00:52,198 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 19:00:52,199 INFO L630 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 [2019-12-07 19:00:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 19:00:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-12-07 19:00:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-12-07 19:00:52,205 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-12-07 19:00:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:52,205 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-12-07 19:00:52,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-12-07 19:00:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 19:00:52,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:52,206 INFO L410 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] [2019-12-07 19:00:52,207 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-12-07 19:00:52,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:52,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985259684] [2019-12-07 19:00:52,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:52,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985259684] [2019-12-07 19:00:52,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:52,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:52,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910109043] [2019-12-07 19:00:52,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:52,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:52,259 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-12-07 19:00:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:52,475 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-12-07 19:00:52,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:52,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 19:00:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:52,477 INFO L225 Difference]: With dead ends: 467 [2019-12-07 19:00:52,477 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 19:00:52,477 INFO L630 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 [2019-12-07 19:00:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 19:00:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-12-07 19:00:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-12-07 19:00:52,481 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-12-07 19:00:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:52,481 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-12-07 19:00:52,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-12-07 19:00:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 19:00:52,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:52,481 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:52,482 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-12-07 19:00:52,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:52,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878103221] [2019-12-07 19:00:52,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878103221] [2019-12-07 19:00:52,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:52,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:52,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587814521] [2019-12-07 19:00:52,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:52,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:52,516 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-12-07 19:00:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:52,914 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-12-07 19:00:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:52,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 19:00:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:52,918 INFO L225 Difference]: With dead ends: 495 [2019-12-07 19:00:52,918 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 19:00:52,918 INFO L630 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 [2019-12-07 19:00:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 19:00:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-12-07 19:00:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 19:00:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-12-07 19:00:52,925 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-12-07 19:00:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:52,926 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-12-07 19:00:52,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-12-07 19:00:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 19:00:52,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:52,927 INFO L410 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] [2019-12-07 19:00:52,928 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-12-07 19:00:52,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:52,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90051463] [2019-12-07 19:00:52,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 19:00:52,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90051463] [2019-12-07 19:00:52,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:52,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:00:52,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626645679] [2019-12-07 19:00:52,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:00:52,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:52,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:00:52,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:00:52,984 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-12-07 19:00:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:53,295 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-12-07 19:00:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:00:53,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-07 19:00:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:53,296 INFO L225 Difference]: With dead ends: 466 [2019-12-07 19:00:53,296 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 19:00:53,297 INFO L630 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 [2019-12-07 19:00:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 19:00:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-12-07 19:00:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-12-07 19:00:53,300 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-12-07 19:00:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:53,301 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-12-07 19:00:53,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:00:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-12-07 19:00:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 19:00:53,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:53,301 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:53,301 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-12-07 19:00:53,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:53,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648736236] [2019-12-07 19:00:53,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648736236] [2019-12-07 19:00:53,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:53,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:53,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152422105] [2019-12-07 19:00:53,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:53,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:53,334 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-12-07 19:00:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:53,600 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-12-07 19:00:53,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:53,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 19:00:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:53,602 INFO L225 Difference]: With dead ends: 535 [2019-12-07 19:00:53,602 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 19:00:53,602 INFO L630 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 [2019-12-07 19:00:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 19:00:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-12-07 19:00:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-12-07 19:00:53,606 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-12-07 19:00:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:53,606 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-12-07 19:00:53,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-12-07 19:00:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 19:00:53,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:53,607 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:53,607 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-12-07 19:00:53,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:53,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695095993] [2019-12-07 19:00:53,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:53,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695095993] [2019-12-07 19:00:53,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:53,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:53,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405538939] [2019-12-07 19:00:53,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:53,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:53,645 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-12-07 19:00:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:53,861 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-12-07 19:00:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:53,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 19:00:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:53,863 INFO L225 Difference]: With dead ends: 506 [2019-12-07 19:00:53,863 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 19:00:53,863 INFO L630 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 [2019-12-07 19:00:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 19:00:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-12-07 19:00:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-12-07 19:00:53,867 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-12-07 19:00:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:53,867 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-12-07 19:00:53,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-12-07 19:00:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 19:00:53,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:53,868 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:53,868 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-12-07 19:00:53,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:53,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659602831] [2019-12-07 19:00:53,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:53,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659602831] [2019-12-07 19:00:53,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:53,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:53,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666055380] [2019-12-07 19:00:53,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:53,904 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-12-07 19:00:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:54,180 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-12-07 19:00:54,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:54,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 19:00:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:54,181 INFO L225 Difference]: With dead ends: 535 [2019-12-07 19:00:54,181 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 19:00:54,182 INFO L630 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 [2019-12-07 19:00:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 19:00:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-12-07 19:00:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-12-07 19:00:54,187 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-12-07 19:00:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:54,187 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-12-07 19:00:54,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-12-07 19:00:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 19:00:54,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:54,188 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:54,188 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-12-07 19:00:54,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:54,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430425171] [2019-12-07 19:00:54,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:54,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430425171] [2019-12-07 19:00:54,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:54,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:54,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557664607] [2019-12-07 19:00:54,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:54,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:54,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:54,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:54,229 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-12-07 19:00:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:54,600 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-12-07 19:00:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:54,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 19:00:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:54,602 INFO L225 Difference]: With dead ends: 506 [2019-12-07 19:00:54,603 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 19:00:54,603 INFO L630 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 [2019-12-07 19:00:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 19:00:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-12-07 19:00:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-12-07 19:00:54,610 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-12-07 19:00:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-12-07 19:00:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-12-07 19:00:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 19:00:54,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:54,611 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:54,611 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-12-07 19:00:54,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:54,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237491188] [2019-12-07 19:00:54,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:54,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237491188] [2019-12-07 19:00:54,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:54,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554768626] [2019-12-07 19:00:54,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:54,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:54,653 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-12-07 19:00:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:54,922 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-12-07 19:00:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:54,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 19:00:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:54,924 INFO L225 Difference]: With dead ends: 535 [2019-12-07 19:00:54,924 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 19:00:54,924 INFO L630 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 [2019-12-07 19:00:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 19:00:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-12-07 19:00:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-12-07 19:00:54,928 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-12-07 19:00:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:54,928 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-12-07 19:00:54,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-12-07 19:00:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 19:00:54,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:54,929 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:54,929 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-12-07 19:00:54,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:54,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882068843] [2019-12-07 19:00:54,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:54,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882068843] [2019-12-07 19:00:54,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:54,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:54,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449297899] [2019-12-07 19:00:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:54,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:54,962 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-12-07 19:00:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:55,157 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-12-07 19:00:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:55,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 19:00:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:55,159 INFO L225 Difference]: With dead ends: 506 [2019-12-07 19:00:55,159 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 19:00:55,159 INFO L630 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 [2019-12-07 19:00:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 19:00:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-12-07 19:00:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-12-07 19:00:55,164 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-12-07 19:00:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:55,164 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-12-07 19:00:55,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-12-07 19:00:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 19:00:55,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:55,165 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:55,166 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-12-07 19:00:55,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:55,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700438450] [2019-12-07 19:00:55,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:55,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700438450] [2019-12-07 19:00:55,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:55,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:55,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814723409] [2019-12-07 19:00:55,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:55,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:55,209 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-12-07 19:00:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:55,495 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-12-07 19:00:55,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:55,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 19:00:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:55,496 INFO L225 Difference]: With dead ends: 525 [2019-12-07 19:00:55,496 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 19:00:55,497 INFO L630 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 [2019-12-07 19:00:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 19:00:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-12-07 19:00:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-12-07 19:00:55,503 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-12-07 19:00:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:55,503 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-12-07 19:00:55,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-12-07 19:00:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 19:00:55,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:55,504 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:55,504 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:55,505 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-12-07 19:00:55,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:55,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703975360] [2019-12-07 19:00:55,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:55,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703975360] [2019-12-07 19:00:55,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:55,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:55,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539659705] [2019-12-07 19:00:55,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:55,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:55,545 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-12-07 19:00:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:55,745 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-12-07 19:00:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:55,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 19:00:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:55,746 INFO L225 Difference]: With dead ends: 496 [2019-12-07 19:00:55,746 INFO L226 Difference]: Without dead ends: 263 [2019-12-07 19:00:55,746 INFO L630 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 [2019-12-07 19:00:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-12-07 19:00:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-12-07 19:00:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-12-07 19:00:55,751 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-12-07 19:00:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:55,751 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-12-07 19:00:55,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-12-07 19:00:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 19:00:55,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:55,752 INFO L410 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] [2019-12-07 19:00:55,753 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-12-07 19:00:55,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:55,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385556168] [2019-12-07 19:00:55,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:00:55,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385556168] [2019-12-07 19:00:55,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:55,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:55,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186285673] [2019-12-07 19:00:55,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:55,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:55,797 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-12-07 19:00:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:56,076 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-12-07 19:00:56,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:56,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 19:00:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:56,078 INFO L225 Difference]: With dead ends: 525 [2019-12-07 19:00:56,078 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 19:00:56,079 INFO L630 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 [2019-12-07 19:00:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 19:00:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-12-07 19:00:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 19:00:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-12-07 19:00:56,084 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-12-07 19:00:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:56,084 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-12-07 19:00:56,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-12-07 19:00:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 19:00:56,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:56,085 INFO L410 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] [2019-12-07 19:00:56,085 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-12-07 19:00:56,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:56,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491251038] [2019-12-07 19:00:56,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 19:00:56,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491251038] [2019-12-07 19:00:56,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:56,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:56,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207457727] [2019-12-07 19:00:56,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:56,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:56,131 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-12-07 19:00:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:56,167 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-12-07 19:00:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:56,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 19:00:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:56,169 INFO L225 Difference]: With dead ends: 716 [2019-12-07 19:00:56,169 INFO L226 Difference]: Without dead ends: 483 [2019-12-07 19:00:56,170 INFO L630 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 [2019-12-07 19:00:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-07 19:00:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-12-07 19:00:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 19:00:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-12-07 19:00:56,177 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-12-07 19:00:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:56,177 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-12-07 19:00:56,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-12-07 19:00:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 19:00:56,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:56,178 INFO L410 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] [2019-12-07 19:00:56,178 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-12-07 19:00:56,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:56,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39658170] [2019-12-07 19:00:56,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 19:00:56,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39658170] [2019-12-07 19:00:56,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:56,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:56,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626015411] [2019-12-07 19:00:56,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:56,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:56,216 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-12-07 19:00:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:56,258 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-12-07 19:00:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:56,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-12-07 19:00:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:56,261 INFO L225 Difference]: With dead ends: 947 [2019-12-07 19:00:56,261 INFO L226 Difference]: Without dead ends: 483 [2019-12-07 19:00:56,261 INFO L630 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 [2019-12-07 19:00:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-07 19:00:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-12-07 19:00:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 19:00:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-12-07 19:00:56,272 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-12-07 19:00:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:56,273 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-12-07 19:00:56,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-12-07 19:00:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 19:00:56,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:56,274 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:56,274 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-12-07 19:00:56,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:56,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888458829] [2019-12-07 19:00:56,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:00:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:00:56,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 19:00:56,434 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:00:56,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:00:56 BoogieIcfgContainer [2019-12-07 19:00:56,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:00:56,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:00:56,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:00:56,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:00:56,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:44" (3/4) ... [2019-12-07 19:00:56,509 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:00:56,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:00:56,510 INFO L168 Benchmark]: Toolchain (without parser) took 12779.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 941.5 MB in the beginning and 1.2 GB in the end (delta: -267.4 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:56,510 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:00:56,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:56,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:56,511 INFO L168 Benchmark]: Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:56,511 INFO L168 Benchmark]: RCFGBuilder took 674.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.9 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:56,512 INFO L168 Benchmark]: TraceAbstraction took 11554.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 990.9 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:00:56,512 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:00:56,513 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 437.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 674.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.9 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11554.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.4 MB). Free memory was 990.9 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={7:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={7:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={7:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={7:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={7:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={7:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={7:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={7:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] 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] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={7:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={7:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={7:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 11017 SDs, 0 SdLazy, 6888 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 78 SyntacticMatches, 29 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, 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, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 765446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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.1.25-f470102 [2019-12-07 19:00:57,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:00:57,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:00:57,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:00:57,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:00:57,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:00:57,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:00:57,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:00:57,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:00:57,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:00:57,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:00:57,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:00:57,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:00:57,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:00:57,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:00:57,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:00:57,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:00:57,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:00:57,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:00:57,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:00:57,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:00:57,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:00:57,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:00:57,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:00:57,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:00:57,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:00:57,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:00:57,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:00:57,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:00:57,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:00:57,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:00:57,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:00:57,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:00:57,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:00:57,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:00:57,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:00:57,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:00:57,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:00:57,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:00:57,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:00:57,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:00:57,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 19:00:57,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:00:57,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:00:57,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:00:57,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:00:57,917 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:00:57,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:00:57,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 19:00:57,918 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:00:57,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:00:57,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:00:57,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 19:00:57,920 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 19:00:57,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:00:57,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:00:57,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:00:57,921 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer 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(__VERIFIER_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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-12-07 19:00:58,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:00:58,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:00:58,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:00:58,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:00:58,096 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:00:58,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:00:58,135 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/f513b6fe3/88736a2ea8b64b53a840ea7d4d11486a/FLAGbe57597ee [2019-12-07 19:00:58,699 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:00:58,700 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:00:58,712 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/f513b6fe3/88736a2ea8b64b53a840ea7d4d11486a/FLAGbe57597ee [2019-12-07 19:00:59,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/data/f513b6fe3/88736a2ea8b64b53a840ea7d4d11486a [2019-12-07 19:00:59,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:00:59,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:00:59,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:59,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:00:59,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:00:59,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258d581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59, skipping insertion in model container [2019-12-07 19:00:59,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:00:59,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:00:59,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:59,461 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:00:59,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:59,542 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:00:59,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59 WrapperNode [2019-12-07 19:00:59,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:59,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:59,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:00:59,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:00:59,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:59,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:00:59,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:00:59,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:00:59,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... [2019-12-07 19:00:59,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:00:59,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:00:59,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:00:59,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:00:59,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/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 [2019-12-07 19:00:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:00:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:00:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 19:00:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:00:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:00:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:00:59,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:00:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 19:00:59,831 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:01:02,615 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 19:01:02,615 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 19:01:02,616 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:01:02,616 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 19:01:02,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:02 BoogieIcfgContainer [2019-12-07 19:01:02,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:01:02,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:01:02,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:01:02,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:01:02,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:00:59" (1/3) ... [2019-12-07 19:01:02,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b04ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:02, skipping insertion in model container [2019-12-07 19:01:02,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:59" (2/3) ... [2019-12-07 19:01:02,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b04ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:02, skipping insertion in model container [2019-12-07 19:01:02,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:02" (3/3) ... [2019-12-07 19:01:02,623 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-12-07 19:01:02,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:01:02,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:01:02,643 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:01:02,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:01:02,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:01:02,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:01:02,661 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:01:02,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:01:02,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:01:02,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:01:02,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:01:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 19:01:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:01:02,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:02,683 INFO L410 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] [2019-12-07 19:01:02,683 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-12-07 19:01:02,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:02,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608479885] [2019-12-07 19:01:02,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/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 [2019-12-07 19:01:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:02,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:01:02,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:02,871 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:02,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608479885] [2019-12-07 19:01:02,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:02,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:01:02,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673629332] [2019-12-07 19:01:02,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:02,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:02,910 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-12-07 19:01:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:03,005 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2019-12-07 19:01:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:03,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 19:01:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:03,017 INFO L225 Difference]: With dead ends: 549 [2019-12-07 19:01:03,017 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 19:01:03,020 INFO L630 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 [2019-12-07 19:01:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 19:01:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2019-12-07 19:01:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-12-07 19:01:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2019-12-07 19:01:03,070 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2019-12-07 19:01:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:03,070 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2019-12-07 19:01:03,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2019-12-07 19:01:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 19:01:03,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:03,073 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:03,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:01:03,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2019-12-07 19:01:03,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:03,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240991395] [2019-12-07 19:01:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/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 [2019-12-07 19:01:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:03,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:01:03,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:03,494 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:03,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240991395] [2019-12-07 19:01:03,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:03,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:01:03,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253189914] [2019-12-07 19:01:03,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:03,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:03,516 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand 4 states. [2019-12-07 19:01:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:03,933 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-12-07 19:01:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:03,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 19:01:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:03,937 INFO L225 Difference]: With dead ends: 853 [2019-12-07 19:01:03,937 INFO L226 Difference]: Without dead ends: 611 [2019-12-07 19:01:03,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-07 19:01:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-12-07 19:01:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-12-07 19:01:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2019-12-07 19:01:03,964 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2019-12-07 19:01:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:03,965 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2019-12-07 19:01:03,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2019-12-07 19:01:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 19:01:03,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:03,970 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:04,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:01:04,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2019-12-07 19:01:04,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:04,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392627606] [2019-12-07 19:01:04,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/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 [2019-12-07 19:01:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:04,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:01:04,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:01:04,371 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 19:01:04,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392627606] [2019-12-07 19:01:04,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:04,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:01:04,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590165367] [2019-12-07 19:01:04,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:04,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:04,393 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand 4 states. [2019-12-07 19:01:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:04,572 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2019-12-07 19:01:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:04,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 19:01:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:04,576 INFO L225 Difference]: With dead ends: 1091 [2019-12-07 19:01:04,576 INFO L226 Difference]: Without dead ends: 611 [2019-12-07 19:01:04,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-07 19:01:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-12-07 19:01:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-12-07 19:01:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2019-12-07 19:01:04,596 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2019-12-07 19:01:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:04,597 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2019-12-07 19:01:04,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2019-12-07 19:01:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 19:01:04,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:04,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:04,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 19:01:04,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-12-07 19:01:04,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:04,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525295740] [2019-12-07 19:01:04,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 19:01:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:01:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:01:05,488 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 19:01:05,489 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:01:05,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 19:01:05,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:01:05 BoogieIcfgContainer [2019-12-07 19:01:05,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:01:05,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:01:05,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:01:05,805 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:01:05,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:02" (3/4) ... [2019-12-07 19:01:05,807 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:01:05,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ff27137d-e2f1-4751-bf6e-634188f5627f/bin/uautomizer/witness.graphml [2019-12-07 19:01:05,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:01:05,886 INFO L168 Benchmark]: Toolchain (without parser) took 6752.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -85.8 MB). Peak memory consumption was 121.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,886 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:01:05,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,887 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,887 INFO L168 Benchmark]: RCFGBuilder took 2966.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,887 INFO L168 Benchmark]: TraceAbstraction took 3186.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 982.3 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,887 INFO L168 Benchmark]: Witness Printer took 79.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:05,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2966.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3186.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 982.3 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Witness Printer took 79.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1228] 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] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={15:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={15:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={15:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 120522 SizeOfPredicates, 2 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...