./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.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_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/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 a4ba7a359047c30b647e3fae146392c1b2eaa08f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:02:03,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:02:03,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:02:03,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:02:03,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:02:03,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:02:03,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:02:03,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:02:03,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:02:03,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:02:03,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:02:03,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:02:03,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:02:03,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:02:03,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:02:03,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:02:03,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:02:03,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:02:03,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:02:03,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:02:03,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:02:03,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:02:03,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:02:03,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:02:03,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:02:03,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:02:03,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:02:03,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:02:03,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:02:03,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:02:03,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:02:03,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:02:03,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:02:03,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:02:03,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:02:03,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:02:03,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:02:03,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:02:03,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:02:03,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:02:03,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:02:03,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:02:03,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:02:03,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:02:03,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:02:03,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:02:03,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:02:03,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:02:03,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:02:03,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:02:03,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:02:03,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:02:03,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:02:03,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:02:03,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:02:03,064 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_f3904026-e51d-4794-954c-e0f83aba8f91/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 -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-12-07 13:02:03,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:02:03,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:02:03,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:02:03,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:02:03,184 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:02:03,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-12-07 13:02:03,225 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/data/d34ff38d8/06161da132cb4cae976fd83caa92c7bf/FLAG1a24daecd [2019-12-07 13:02:03,623 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:02:03,624 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-12-07 13:02:03,631 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/data/d34ff38d8/06161da132cb4cae976fd83caa92c7bf/FLAG1a24daecd [2019-12-07 13:02:03,999 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/data/d34ff38d8/06161da132cb4cae976fd83caa92c7bf [2019-12-07 13:02:04,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:02:04,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:02:04,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:02:04,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:02:04,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:02:04,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7802ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04, skipping insertion in model container [2019-12-07 13:02:04,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:02:04,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:02:04,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:02:04,219 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:02:04,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:02:04,266 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:02:04,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04 WrapperNode [2019-12-07 13:02:04,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:02:04,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:02:04,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:02:04,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:02:04,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:02:04,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:02:04,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:02:04,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:02:04,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... [2019-12-07 13:02:04,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:02:04,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:02:04,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:02:04,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:02:04,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/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 13:02:04,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:02:04,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:02:04,462 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:02:04,774 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 13:02:04,774 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 13:02:04,775 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:02:04,775 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:02:04,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:02:04 BoogieIcfgContainer [2019-12-07 13:02:04,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:02:04,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:02:04,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:02:04,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:02:04,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:02:04" (1/3) ... [2019-12-07 13:02:04,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d13f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:02:04, skipping insertion in model container [2019-12-07 13:02:04,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:02:04" (2/3) ... [2019-12-07 13:02:04,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d13f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:02:04, skipping insertion in model container [2019-12-07 13:02:04,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:02:04" (3/3) ... [2019-12-07 13:02:04,781 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-12-07 13:02:04,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:02:04,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:02:04,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:02:04,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:02:04,815 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:02:04,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:02:04,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:02:04,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:02:04,816 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:02:04,816 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:02:04,816 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:02:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-12-07 13:02:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:02:04,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:04,833 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] [2019-12-07 13:02:04,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-12-07 13:02:04,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:04,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50110176] [2019-12-07 13:02:04,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:04,966 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 13:02:04,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50110176] [2019-12-07 13:02:04,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:04,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:04,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902724039] [2019-12-07 13:02:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:04,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:04,981 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-12-07 13:02:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,120 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-12-07 13:02:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 13:02:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,130 INFO L225 Difference]: With dead ends: 324 [2019-12-07 13:02:05,130 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 13:02:05,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 13:02:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-12-07 13:02:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:02:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-12-07 13:02:05,168 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-12-07 13:02:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-12-07 13:02:05,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-12-07 13:02:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:02:05,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,171 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] [2019-12-07 13:02:05,171 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-12-07 13:02:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40809584] [2019-12-07 13:02:05,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,214 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 13:02:05,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40809584] [2019-12-07 13:02:05,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673977563] [2019-12-07 13:02:05,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,216 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-12-07 13:02:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,299 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-12-07 13:02:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 13:02:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,301 INFO L225 Difference]: With dead ends: 329 [2019-12-07 13:02:05,301 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 13:02:05,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 13:02:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-12-07 13:02:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-12-07 13:02:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-12-07 13:02:05,313 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-12-07 13:02:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,314 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-12-07 13:02:05,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-12-07 13:02:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:02:05,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,315 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] [2019-12-07 13:02:05,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-12-07 13:02:05,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006824674] [2019-12-07 13:02:05,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,345 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 13:02:05,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006824674] [2019-12-07 13:02:05,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595354570] [2019-12-07 13:02:05,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,347 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-12-07 13:02:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,441 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-12-07 13:02:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 13:02:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,442 INFO L225 Difference]: With dead ends: 359 [2019-12-07 13:02:05,443 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 13:02:05,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 13:02:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-12-07 13:02:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 13:02:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-12-07 13:02:05,454 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-12-07 13:02:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,454 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-12-07 13:02:05,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-12-07 13:02:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:02:05,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,456 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] [2019-12-07 13:02:05,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-12-07 13:02:05,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519241688] [2019-12-07 13:02:05,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,486 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 13:02:05,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519241688] [2019-12-07 13:02:05,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668400976] [2019-12-07 13:02:05,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,488 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-12-07 13:02:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,580 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-12-07 13:02:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 13:02:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,582 INFO L225 Difference]: With dead ends: 364 [2019-12-07 13:02:05,582 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:02:05,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:02:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-12-07 13:02:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 13:02:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-12-07 13:02:05,594 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-12-07 13:02:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,595 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-12-07 13:02:05,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-12-07 13:02:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:02:05,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,596 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] [2019-12-07 13:02:05,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-12-07 13:02:05,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766046228] [2019-12-07 13:02:05,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,626 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 13:02:05,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766046228] [2019-12-07 13:02:05,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090776585] [2019-12-07 13:02:05,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,629 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-12-07 13:02:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,704 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-12-07 13:02:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 13:02:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,706 INFO L225 Difference]: With dead ends: 375 [2019-12-07 13:02:05,706 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:02:05,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:02:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-12-07 13:02:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 13:02:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-12-07 13:02:05,713 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-12-07 13:02:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,713 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-12-07 13:02:05,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-12-07 13:02:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:02:05,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,714 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] [2019-12-07 13:02:05,715 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-12-07 13:02:05,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734181123] [2019-12-07 13:02:05,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,735 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 13:02:05,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734181123] [2019-12-07 13:02:05,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445480010] [2019-12-07 13:02:05,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,736 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-12-07 13:02:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,815 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-12-07 13:02:05,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 13:02:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,817 INFO L225 Difference]: With dead ends: 375 [2019-12-07 13:02:05,817 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:02:05,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:02:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-12-07 13:02:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 13:02:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-12-07 13:02:05,825 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-12-07 13:02:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,825 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-12-07 13:02:05,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-12-07 13:02:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:02:05,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,827 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] [2019-12-07 13:02:05,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-12-07 13:02:05,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440836058] [2019-12-07 13:02:05,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,850 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 13:02:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440836058] [2019-12-07 13:02:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487393489] [2019-12-07 13:02:05,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:05,852 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-12-07 13:02:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:05,926 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-12-07 13:02:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:05,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 13:02:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:05,928 INFO L225 Difference]: With dead ends: 375 [2019-12-07 13:02:05,928 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 13:02:05,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 13:02:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-12-07 13:02:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 13:02:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-12-07 13:02:05,934 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-12-07 13:02:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:05,934 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-12-07 13:02:05,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-12-07 13:02:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:02:05,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:05,935 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] [2019-12-07 13:02:05,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-12-07 13:02:05,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:05,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075503775] [2019-12-07 13:02:05,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:05,968 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 13:02:05,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075503775] [2019-12-07 13:02:05,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:05,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:05,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884568231] [2019-12-07 13:02:05,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:02:05,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:02:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:05,969 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-12-07 13:02:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,110 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-12-07 13:02:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:02:06,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 13:02:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,112 INFO L225 Difference]: With dead ends: 571 [2019-12-07 13:02:06,112 INFO L226 Difference]: Without dead ends: 392 [2019-12-07 13:02:06,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:02:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-07 13:02:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-12-07 13:02:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 13:02:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-12-07 13:02:06,122 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-12-07 13:02:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,123 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-12-07 13:02:06,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:02:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-12-07 13:02:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:02:06,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,123 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] [2019-12-07 13:02:06,123 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-12-07 13:02:06,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902582075] [2019-12-07 13:02:06,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,141 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 13:02:06,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902582075] [2019-12-07 13:02:06,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009257093] [2019-12-07 13:02:06,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,142 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-12-07 13:02:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,244 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-12-07 13:02:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:02:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,247 INFO L225 Difference]: With dead ends: 780 [2019-12-07 13:02:06,247 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 13:02:06,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 13:02:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-12-07 13:02:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-07 13:02:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-12-07 13:02:06,261 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-12-07 13:02:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,262 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-12-07 13:02:06,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-12-07 13:02:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:02:06,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,262 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] [2019-12-07 13:02:06,262 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-12-07 13:02:06,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494634059] [2019-12-07 13:02:06,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,282 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 13:02:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494634059] [2019-12-07 13:02:06,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176953333] [2019-12-07 13:02:06,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,283 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-12-07 13:02:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,385 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-12-07 13:02:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 13:02:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,388 INFO L225 Difference]: With dead ends: 857 [2019-12-07 13:02:06,388 INFO L226 Difference]: Without dead ends: 453 [2019-12-07 13:02:06,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-12-07 13:02:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-12-07 13:02:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-07 13:02:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-12-07 13:02:06,402 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-12-07 13:02:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,402 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-12-07 13:02:06,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-12-07 13:02:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:02:06,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,403 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] [2019-12-07 13:02:06,403 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-12-07 13:02:06,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182258003] [2019-12-07 13:02:06,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,423 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 13:02:06,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182258003] [2019-12-07 13:02:06,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160205665] [2019-12-07 13:02:06,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,424 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-12-07 13:02:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,543 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-12-07 13:02:06,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 13:02:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,545 INFO L225 Difference]: With dead ends: 924 [2019-12-07 13:02:06,546 INFO L226 Difference]: Without dead ends: 498 [2019-12-07 13:02:06,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-07 13:02:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-12-07 13:02:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-07 13:02:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-12-07 13:02:06,558 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-12-07 13:02:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,558 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-12-07 13:02:06,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-12-07 13:02:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:02:06,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,558 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] [2019-12-07 13:02:06,558 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-12-07 13:02:06,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073314496] [2019-12-07 13:02:06,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,576 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 13:02:06,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073314496] [2019-12-07 13:02:06,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008910884] [2019-12-07 13:02:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,578 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-12-07 13:02:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,697 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-12-07 13:02:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 13:02:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,701 INFO L225 Difference]: With dead ends: 991 [2019-12-07 13:02:06,701 INFO L226 Difference]: Without dead ends: 510 [2019-12-07 13:02:06,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-07 13:02:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-12-07 13:02:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 13:02:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-12-07 13:02:06,719 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-12-07 13:02:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,719 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-12-07 13:02:06,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-12-07 13:02:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:02:06,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,721 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:02:06,721 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-12-07 13:02:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559472407] [2019-12-07 13:02:06,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:06,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559472407] [2019-12-07 13:02:06,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491450376] [2019-12-07 13:02:06,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,743 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-12-07 13:02:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,838 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-12-07 13:02:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 13:02:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,840 INFO L225 Difference]: With dead ends: 1007 [2019-12-07 13:02:06,840 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 13:02:06,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 13:02:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-12-07 13:02:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 13:02:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-12-07 13:02:06,853 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-12-07 13:02:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,853 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-12-07 13:02:06,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-12-07 13:02:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:02:06,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,854 INFO L410 BasicCegarLoop]: trace histogram [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 13:02:06,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-12-07 13:02:06,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857156298] [2019-12-07 13:02:06,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 13:02:06,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857156298] [2019-12-07 13:02:06,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:06,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:06,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555324571] [2019-12-07 13:02:06,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:06,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:06,875 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-12-07 13:02:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:06,964 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-12-07 13:02:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 13:02:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:06,967 INFO L225 Difference]: With dead ends: 1035 [2019-12-07 13:02:06,967 INFO L226 Difference]: Without dead ends: 542 [2019-12-07 13:02:06,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-07 13:02:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-12-07 13:02:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-07 13:02:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-12-07 13:02:06,981 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-12-07 13:02:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-12-07 13:02:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-12-07 13:02:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:02:06,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:06,982 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:02:06,982 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-12-07 13:02:06,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:06,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464387775] [2019-12-07 13:02:06,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,001 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 13:02:07,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464387775] [2019-12-07 13:02:07,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846908994] [2019-12-07 13:02:07,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,002 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-12-07 13:02:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,100 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-12-07 13:02:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 13:02:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,104 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 13:02:07,104 INFO L226 Difference]: Without dead ends: 570 [2019-12-07 13:02:07,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-07 13:02:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-12-07 13:02:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-07 13:02:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-12-07 13:02:07,125 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-12-07 13:02:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,125 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-12-07 13:02:07,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-12-07 13:02:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:02:07,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,127 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:02:07,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-12-07 13:02:07,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182859669] [2019-12-07 13:02:07,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 13:02:07,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182859669] [2019-12-07 13:02:07,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988671906] [2019-12-07 13:02:07,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,149 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-12-07 13:02:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,251 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-12-07 13:02:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 13:02:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,255 INFO L225 Difference]: With dead ends: 1143 [2019-12-07 13:02:07,255 INFO L226 Difference]: Without dead ends: 580 [2019-12-07 13:02:07,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-07 13:02:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-12-07 13:02:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-07 13:02:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-12-07 13:02:07,275 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-12-07 13:02:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,276 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-12-07 13:02:07,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-12-07 13:02:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 13:02:07,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,277 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:07,277 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-12-07 13:02:07,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249901093] [2019-12-07 13:02:07,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:07,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249901093] [2019-12-07 13:02:07,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225390603] [2019-12-07 13:02:07,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,299 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-12-07 13:02:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,410 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-12-07 13:02:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 13:02:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,414 INFO L225 Difference]: With dead ends: 1180 [2019-12-07 13:02:07,414 INFO L226 Difference]: Without dead ends: 617 [2019-12-07 13:02:07,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-07 13:02:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-12-07 13:02:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-07 13:02:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-12-07 13:02:07,438 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-12-07 13:02:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,438 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-12-07 13:02:07,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-12-07 13:02:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:02:07,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,440 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:07,440 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-12-07 13:02:07,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037928931] [2019-12-07 13:02:07,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,469 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 13:02:07,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037928931] [2019-12-07 13:02:07,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858244287] [2019-12-07 13:02:07,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,471 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-12-07 13:02:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,603 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-12-07 13:02:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 13:02:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,607 INFO L225 Difference]: With dead ends: 1223 [2019-12-07 13:02:07,607 INFO L226 Difference]: Without dead ends: 617 [2019-12-07 13:02:07,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-07 13:02:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-12-07 13:02:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-07 13:02:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-12-07 13:02:07,630 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-12-07 13:02:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,631 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-12-07 13:02:07,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-12-07 13:02:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:02:07,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 13:02:07,632 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-12-07 13:02:07,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337234829] [2019-12-07 13:02:07,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 13:02:07,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337234829] [2019-12-07 13:02:07,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056687683] [2019-12-07 13:02:07,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,661 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-12-07 13:02:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,759 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-12-07 13:02:07,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 13:02:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,763 INFO L225 Difference]: With dead ends: 1255 [2019-12-07 13:02:07,763 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 13:02:07,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 13:02:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-12-07 13:02:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-12-07 13:02:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-12-07 13:02:07,789 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-12-07 13:02:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,790 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-12-07 13:02:07,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-12-07 13:02:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 13:02:07,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,791 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-12-07 13:02:07,792 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-12-07 13:02:07,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437082427] [2019-12-07 13:02:07,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 13:02:07,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437082427] [2019-12-07 13:02:07,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114732962] [2019-12-07 13:02:07,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,815 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-12-07 13:02:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:07,907 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-12-07 13:02:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:07,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 13:02:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:07,911 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 13:02:07,911 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 13:02:07,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 13:02:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-12-07 13:02:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-12-07 13:02:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-12-07 13:02:07,936 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-12-07 13:02:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:07,937 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-12-07 13:02:07,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-12-07 13:02:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:02:07,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:07,938 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:02:07,939 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-12-07 13:02:07,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:07,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156587136] [2019-12-07 13:02:07,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 13:02:07,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156587136] [2019-12-07 13:02:07,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:07,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:07,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794239546] [2019-12-07 13:02:07,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:07,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:07,958 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-12-07 13:02:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:08,062 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-12-07 13:02:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:08,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 13:02:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:08,066 INFO L225 Difference]: With dead ends: 1315 [2019-12-07 13:02:08,066 INFO L226 Difference]: Without dead ends: 681 [2019-12-07 13:02:08,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-12-07 13:02:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-12-07 13:02:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 13:02:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-12-07 13:02:08,092 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-12-07 13:02:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:08,092 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-12-07 13:02:08,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-12-07 13:02:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 13:02:08,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:08,094 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:02:08,094 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:08,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-12-07 13:02:08,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:08,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971274397] [2019-12-07 13:02:08,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 13:02:08,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971274397] [2019-12-07 13:02:08,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:08,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:08,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477495643] [2019-12-07 13:02:08,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:08,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:08,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:08,120 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-12-07 13:02:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:08,222 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-12-07 13:02:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:08,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 13:02:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:08,226 INFO L225 Difference]: With dead ends: 1351 [2019-12-07 13:02:08,227 INFO L226 Difference]: Without dead ends: 681 [2019-12-07 13:02:08,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:02:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-12-07 13:02:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-12-07 13:02:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 13:02:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-12-07 13:02:08,251 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-12-07 13:02:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:08,251 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-12-07 13:02:08,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-12-07 13:02:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:02:08,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:08,253 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 13:02:08,253 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-12-07 13:02:08,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:08,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87652623] [2019-12-07 13:02:08,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:02:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87652623] [2019-12-07 13:02:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:08,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631424272] [2019-12-07 13:02:08,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:08,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:08,282 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-12-07 13:02:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:08,312 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-12-07 13:02:08,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:08,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 13:02:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:08,318 INFO L225 Difference]: With dead ends: 2003 [2019-12-07 13:02:08,318 INFO L226 Difference]: Without dead ends: 1333 [2019-12-07 13:02:08,319 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 13:02:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-12-07 13:02:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-12-07 13:02:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-07 13:02:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-12-07 13:02:08,339 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-12-07 13:02:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:08,340 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-12-07 13:02:08,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-12-07 13:02:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:02:08,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:08,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 13:02:08,341 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-12-07 13:02:08,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:08,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402018103] [2019-12-07 13:02:08,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:02:08,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402018103] [2019-12-07 13:02:08,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:08,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:08,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211711191] [2019-12-07 13:02:08,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:08,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:08,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:08,365 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-12-07 13:02:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:08,398 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-12-07 13:02:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:08,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 13:02:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:08,401 INFO L225 Difference]: With dead ends: 1362 [2019-12-07 13:02:08,401 INFO L226 Difference]: Without dead ends: 690 [2019-12-07 13:02:08,402 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 13:02:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-12-07 13:02:08,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-12-07 13:02:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 13:02:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-12-07 13:02:08,420 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-12-07 13:02:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:08,420 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-12-07 13:02:08,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-12-07 13:02:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:02:08,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:08,421 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 13:02:08,421 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-12-07 13:02:08,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:08,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991249884] [2019-12-07 13:02:08,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 13:02:08,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991249884] [2019-12-07 13:02:08,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:08,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:02:08,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594331929] [2019-12-07 13:02:08,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:08,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:08,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:08,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:08,450 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-12-07 13:02:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:08,496 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-12-07 13:02:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:08,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-07 13:02:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:08,502 INFO L225 Difference]: With dead ends: 2017 [2019-12-07 13:02:08,502 INFO L226 Difference]: Without dead ends: 1347 [2019-12-07 13:02:08,503 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 13:02:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-12-07 13:02:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-12-07 13:02:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-12-07 13:02:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-12-07 13:02:08,536 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-12-07 13:02:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:08,537 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-12-07 13:02:08,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-12-07 13:02:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 13:02:08,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:08,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 13:02:08,538 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-12-07 13:02:08,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:08,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397879127] [2019-12-07 13:02:08,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:08,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:02:08,610 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:02:08,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:02:08 BoogieIcfgContainer [2019-12-07 13:02:08,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:02:08,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:02:08,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:02:08,657 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:02:08,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:02:04" (3/4) ... [2019-12-07 13:02:08,659 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:02:08,716 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3904026-e51d-4794-954c-e0f83aba8f91/bin/uautomizer/witness.graphml [2019-12-07 13:02:08,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:02:08,718 INFO L168 Benchmark]: Toolchain (without parser) took 4714.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,718 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:02:08,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,719 INFO L168 Benchmark]: Boogie Preprocessor took 32.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,720 INFO L168 Benchmark]: RCFGBuilder took 437.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,720 INFO L168 Benchmark]: TraceAbstraction took 3879.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.6 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,720 INFO L168 Benchmark]: Witness Printer took 59.54 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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:08,722 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 437.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3879.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.6 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.54 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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.7s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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...