./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.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_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/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 96aededabe895f84f71d6d614ed1af512bf7353b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:57:03,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:57:03,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:57:03,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:57:03,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:57:03,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:57:03,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:57:03,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:57:03,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:57:03,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:57:03,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:57:03,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:57:03,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:57:03,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:57:03,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:57:03,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:57:03,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:57:03,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:57:03,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:57:03,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:57:03,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:57:03,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:57:03,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:57:03,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:57:03,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:57:03,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:57:03,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:57:03,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:57:03,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:57:03,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:57:03,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:57:03,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:57:03,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:57:03,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:57:03,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:57:03,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:57:03,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:57:03,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:57:03,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:57:03,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:57:03,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:57:03,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:57:03,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:57:03,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:57:03,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:57:03,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:57:03,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:57:03,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:57:03,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:57:03,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:57:03,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:57:03,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:57:03,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:57:03,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:57:03,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:57:03,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:57:03,302 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_ad858976-c5fa-4c5c-acb5-888fd9690110/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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-12-07 12:57:03,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:57:03,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:57:03,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:57:03,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:57:03,415 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:57:03,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 12:57:03,454 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/data/6eff9b4f3/2a9d41851fa74d359b3fa7ba8de676ab/FLAG32af4d386 [2019-12-07 12:57:03,907 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:57:03,908 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 12:57:03,917 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/data/6eff9b4f3/2a9d41851fa74d359b3fa7ba8de676ab/FLAG32af4d386 [2019-12-07 12:57:03,926 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/data/6eff9b4f3/2a9d41851fa74d359b3fa7ba8de676ab [2019-12-07 12:57:03,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:57:03,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:57:03,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:57:03,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:57:03,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:57:03,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:57:03" (1/1) ... [2019-12-07 12:57:03,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df66d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:03, skipping insertion in model container [2019-12-07 12:57:03,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:57:03" (1/1) ... [2019-12-07 12:57:03,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:57:03,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:57:04,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:57:04,136 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:57:04,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:57:04,180 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:57:04,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04 WrapperNode [2019-12-07 12:57:04,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:57:04,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:57:04,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:57:04,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:57:04,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:57:04,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:57:04,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:57:04,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:57:04,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... [2019-12-07 12:57:04,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:57:04,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:57:04,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:57:04,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:57:04,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/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 12:57:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:57:04,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:57:04,350 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:57:04,645 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 12:57:04,645 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 12:57:04,646 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:57:04,646 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:57:04,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:04 BoogieIcfgContainer [2019-12-07 12:57:04,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:57:04,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:57:04,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:57:04,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:57:04,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:57:03" (1/3) ... [2019-12-07 12:57:04,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee7de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:57:04, skipping insertion in model container [2019-12-07 12:57:04,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:57:04" (2/3) ... [2019-12-07 12:57:04,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee7de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:57:04, skipping insertion in model container [2019-12-07 12:57:04,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:04" (3/3) ... [2019-12-07 12:57:04,652 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 12:57:04,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:57:04,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:57:04,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:57:04,686 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:57:04,686 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:57:04,686 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:57:04,686 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:57:04,686 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:57:04,686 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:57:04,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:57:04,687 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:57:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-12-07 12:57:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:57:04,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:04,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:04,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-12-07 12:57:04,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:04,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626825572] [2019-12-07 12:57:04,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:04,869 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 12:57:04,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626825572] [2019-12-07 12:57:04,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:04,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:04,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187010921] [2019-12-07 12:57:04,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:04,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:04,885 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-12-07 12:57:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,071 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-12-07 12:57:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 12:57:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,082 INFO L225 Difference]: With dead ends: 322 [2019-12-07 12:57:05,082 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 12:57:05,084 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 12:57:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 12:57:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-12-07 12:57:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 12:57:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-12-07 12:57:05,122 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-12-07 12:57:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,122 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-12-07 12:57:05,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-12-07 12:57:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:57:05,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:05,125 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-12-07 12:57:05,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951673231] [2019-12-07 12:57:05,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,181 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 12:57:05,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951673231] [2019-12-07 12:57:05,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370121595] [2019-12-07 12:57:05,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,184 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-12-07 12:57:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,310 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-12-07 12:57:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 12:57:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,313 INFO L225 Difference]: With dead ends: 371 [2019-12-07 12:57:05,313 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 12:57:05,314 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 12:57:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 12:57:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-12-07 12:57:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 12:57:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-07 12:57:05,326 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-12-07 12:57:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,327 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-07 12:57:05,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-07 12:57:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 12:57:05,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,329 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, 1, 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 12:57:05,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-12-07 12:57:05,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374357936] [2019-12-07 12:57:05,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:05,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374357936] [2019-12-07 12:57:05,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974731883] [2019-12-07 12:57:05,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,372 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-12-07 12:57:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,485 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-12-07 12:57:05,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 12:57:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,487 INFO L225 Difference]: With dead ends: 436 [2019-12-07 12:57:05,487 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 12:57:05,488 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 12:57:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 12:57:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-12-07 12:57:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 12:57:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-12-07 12:57:05,501 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-12-07 12:57:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,502 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-12-07 12:57:05,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-12-07 12:57:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 12:57:05,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,504 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 12:57:05,504 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-12-07 12:57:05,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654421776] [2019-12-07 12:57:05,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:05,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654421776] [2019-12-07 12:57:05,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186042815] [2019-12-07 12:57:05,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,539 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-12-07 12:57:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,620 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-12-07 12:57:05,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 12:57:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,622 INFO L225 Difference]: With dead ends: 484 [2019-12-07 12:57:05,622 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 12:57:05,623 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 12:57:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 12:57:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-12-07 12:57:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 12:57:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-12-07 12:57:05,635 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-12-07 12:57:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,635 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-12-07 12:57:05,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-12-07 12:57:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 12:57:05,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,641 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:05,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-12-07 12:57:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420346604] [2019-12-07 12:57:05,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:05,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420346604] [2019-12-07 12:57:05,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080202888] [2019-12-07 12:57:05,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,688 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-12-07 12:57:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,783 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-12-07 12:57:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 12:57:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,785 INFO L225 Difference]: With dead ends: 543 [2019-12-07 12:57:05,785 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:57:05,786 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 12:57:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:57:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-12-07 12:57:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 12:57:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-12-07 12:57:05,793 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-12-07 12:57:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,794 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-12-07 12:57:05,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-12-07 12:57:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:57:05,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,795 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 12:57:05,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-12-07 12:57:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884957663] [2019-12-07 12:57:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:05,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884957663] [2019-12-07 12:57:05,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832357390] [2019-12-07 12:57:05,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,820 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-12-07 12:57:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:05,894 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-12-07 12:57:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:05,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 12:57:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:05,896 INFO L225 Difference]: With dead ends: 583 [2019-12-07 12:57:05,896 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 12:57:05,897 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 12:57:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 12:57:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-12-07 12:57:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 12:57:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-12-07 12:57:05,907 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-12-07 12:57:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:05,907 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-12-07 12:57:05,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-12-07 12:57:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:57:05,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:05,908 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:05,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-12-07 12:57:05,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:05,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271389428] [2019-12-07 12:57:05,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:57:05,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271389428] [2019-12-07 12:57:05,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:05,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:05,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514819409] [2019-12-07 12:57:05,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:05,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:05,944 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-12-07 12:57:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,051 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-12-07 12:57:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 12:57:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,053 INFO L225 Difference]: With dead ends: 585 [2019-12-07 12:57:06,053 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 12:57:06,054 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 12:57:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 12:57:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-12-07 12:57:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 12:57:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-12-07 12:57:06,064 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-12-07 12:57:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,064 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-12-07 12:57:06,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-12-07 12:57:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:57:06,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,066 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:06,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-12-07 12:57:06,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244215016] [2019-12-07 12:57:06,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:57:06,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244215016] [2019-12-07 12:57:06,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729569914] [2019-12-07 12:57:06,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,099 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-12-07 12:57:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,162 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-12-07 12:57:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 12:57:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,165 INFO L225 Difference]: With dead ends: 585 [2019-12-07 12:57:06,165 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 12:57:06,166 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 12:57:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 12:57:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-12-07 12:57:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-07 12:57:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-12-07 12:57:06,176 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-12-07 12:57:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,177 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-12-07 12:57:06,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-12-07 12:57:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:57:06,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,178 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 12:57:06,178 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-12-07 12:57:06,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976881617] [2019-12-07 12:57:06,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:06,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976881617] [2019-12-07 12:57:06,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645360348] [2019-12-07 12:57:06,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,213 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-12-07 12:57:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,306 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-12-07 12:57:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 12:57:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,308 INFO L225 Difference]: With dead ends: 624 [2019-12-07 12:57:06,308 INFO L226 Difference]: Without dead ends: 331 [2019-12-07 12:57:06,309 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 12:57:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-07 12:57:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-12-07 12:57:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-07 12:57:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-12-07 12:57:06,316 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-12-07 12:57:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,316 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-12-07 12:57:06,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-12-07 12:57:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:57:06,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:06,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-12-07 12:57:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477751227] [2019-12-07 12:57:06,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:06,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477751227] [2019-12-07 12:57:06,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097200248] [2019-12-07 12:57:06,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,340 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-12-07 12:57:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,441 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-12-07 12:57:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 12:57:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,443 INFO L225 Difference]: With dead ends: 685 [2019-12-07 12:57:06,443 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 12:57:06,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 12:57:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 12:57:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-12-07 12:57:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 12:57:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-12-07 12:57:06,452 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-12-07 12:57:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,452 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-12-07 12:57:06,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-12-07 12:57:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:57:06,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,453 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 12:57:06,453 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-12-07 12:57:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932309651] [2019-12-07 12:57:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:06,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932309651] [2019-12-07 12:57:06,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177720045] [2019-12-07 12:57:06,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,475 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-12-07 12:57:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,573 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-12-07 12:57:06,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 12:57:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,575 INFO L225 Difference]: With dead ends: 707 [2019-12-07 12:57:06,575 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 12:57:06,575 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 12:57:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 12:57:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-12-07 12:57:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 12:57:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-12-07 12:57:06,584 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-12-07 12:57:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,584 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-12-07 12:57:06,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-12-07 12:57:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:57:06,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,585 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:06,585 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-12-07 12:57:06,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546004500] [2019-12-07 12:57:06,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 12:57:06,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546004500] [2019-12-07 12:57:06,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030927184] [2019-12-07 12:57:06,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,606 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-12-07 12:57:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,702 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-12-07 12:57:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 12:57:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,704 INFO L225 Difference]: With dead ends: 712 [2019-12-07 12:57:06,704 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 12:57:06,705 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 12:57:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 12:57:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-12-07 12:57:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 12:57:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-12-07 12:57:06,713 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-12-07 12:57:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,713 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-12-07 12:57:06,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-12-07 12:57:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 12:57:06,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,714 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:57:06,715 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-12-07 12:57:06,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851156781] [2019-12-07 12:57:06,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 12:57:06,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851156781] [2019-12-07 12:57:06,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382674621] [2019-12-07 12:57:06,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,735 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-12-07 12:57:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,822 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-12-07 12:57:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 12:57:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,825 INFO L225 Difference]: With dead ends: 730 [2019-12-07 12:57:06,825 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 12:57:06,826 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 12:57:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 12:57:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-12-07 12:57:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 12:57:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-12-07 12:57:06,839 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-12-07 12:57:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,839 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-12-07 12:57:06,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-12-07 12:57:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 12:57:06,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,841 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:57:06,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-12-07 12:57:06,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475109614] [2019-12-07 12:57:06,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 12:57:06,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475109614] [2019-12-07 12:57:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:06,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777386116] [2019-12-07 12:57:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:06,869 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-12-07 12:57:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:06,963 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-12-07 12:57:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:06,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 12:57:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:06,965 INFO L225 Difference]: With dead ends: 751 [2019-12-07 12:57:06,965 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 12:57:06,965 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 12:57:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 12:57:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-12-07 12:57:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 12:57:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-12-07 12:57:06,975 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-12-07 12:57:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:06,975 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-12-07 12:57:06,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-12-07 12:57:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 12:57:06,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:06,976 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:06,976 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-12-07 12:57:06,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:06,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805094899] [2019-12-07 12:57:06,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 12:57:07,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805094899] [2019-12-07 12:57:07,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:07,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:07,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403360556] [2019-12-07 12:57:07,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:07,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:07,006 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-12-07 12:57:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:07,037 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-12-07 12:57:07,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:07,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 12:57:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:07,040 INFO L225 Difference]: With dead ends: 747 [2019-12-07 12:57:07,041 INFO L226 Difference]: Without dead ends: 745 [2019-12-07 12:57:07,041 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 12:57:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-12-07 12:57:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-12-07 12:57:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-07 12:57:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-12-07 12:57:07,059 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-12-07 12:57:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:07,060 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-12-07 12:57:07,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-12-07 12:57:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 12:57:07,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:07,061 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 12:57:07,061 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-12-07 12:57:07,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:07,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602749393] [2019-12-07 12:57:07,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:07,067 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:07,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964287785] [2019-12-07 12:57:07,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:07,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:57:07,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 12:57:07,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602749393] [2019-12-07 12:57:07,163 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964287785] [2019-12-07 12:57:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:07,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:57:07,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657218526] [2019-12-07 12:57:07,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:07,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:07,165 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-12-07 12:57:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:07,211 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-12-07 12:57:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:07,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 12:57:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:07,217 INFO L225 Difference]: With dead ends: 1851 [2019-12-07 12:57:07,217 INFO L226 Difference]: Without dead ends: 1113 [2019-12-07 12:57:07,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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 12:57:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-07 12:57:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-12-07 12:57:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-07 12:57:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-12-07 12:57:07,260 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-12-07 12:57:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:07,261 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-12-07 12:57:07,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-12-07 12:57:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 12:57:07,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:07,264 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:07,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:07,465 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-12-07 12:57:07,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:07,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690149495] [2019-12-07 12:57:07,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:07,473 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:07,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191368849] [2019-12-07 12:57:07,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:07,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:57:07,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 12:57:07,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690149495] [2019-12-07 12:57:07,550 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:07,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191368849] [2019-12-07 12:57:07,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:07,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:07,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293872625] [2019-12-07 12:57:07,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:07,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:07,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:07,552 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-12-07 12:57:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:07,603 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-12-07 12:57:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:07,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-12-07 12:57:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:07,609 INFO L225 Difference]: With dead ends: 2219 [2019-12-07 12:57:07,609 INFO L226 Difference]: Without dead ends: 1481 [2019-12-07 12:57:07,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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 12:57:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-12-07 12:57:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-12-07 12:57:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-07 12:57:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-12-07 12:57:07,646 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-12-07 12:57:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:07,646 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-12-07 12:57:07,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-12-07 12:57:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:57:07,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:07,649 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:07,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:07,850 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-12-07 12:57:07,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:07,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605361550] [2019-12-07 12:57:07,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 12:57:07,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605361550] [2019-12-07 12:57:07,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:07,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:07,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300018554] [2019-12-07 12:57:07,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:07,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:07,880 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-12-07 12:57:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:08,007 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-12-07 12:57:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:08,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 12:57:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:08,016 INFO L225 Difference]: With dead ends: 3059 [2019-12-07 12:57:08,016 INFO L226 Difference]: Without dead ends: 1585 [2019-12-07 12:57:08,018 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 12:57:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-12-07 12:57:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-12-07 12:57:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-12-07 12:57:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-12-07 12:57:08,067 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-12-07 12:57:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:08,068 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-12-07 12:57:08,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-12-07 12:57:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:57:08,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:08,071 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:08,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-12-07 12:57:08,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:08,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947971424] [2019-12-07 12:57:08,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:08,079 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:08,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452845969] [2019-12-07 12:57:08,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:08,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:57:08,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:57:08,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947971424] [2019-12-07 12:57:08,161 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:08,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452845969] [2019-12-07 12:57:08,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:08,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:08,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017278144] [2019-12-07 12:57:08,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:08,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:08,162 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-12-07 12:57:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:08,220 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-12-07 12:57:08,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:08,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 12:57:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:08,231 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 12:57:08,231 INFO L226 Difference]: Without dead ends: 1964 [2019-12-07 12:57:08,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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 12:57:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-07 12:57:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-12-07 12:57:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-12-07 12:57:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-12-07 12:57:08,311 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-12-07 12:57:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:08,311 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-12-07 12:57:08,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-12-07 12:57:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 12:57:08,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:08,317 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:08,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:08,517 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-12-07 12:57:08,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:08,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681522849] [2019-12-07 12:57:08,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:08,527 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:08,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347701804] [2019-12-07 12:57:08,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:08,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:08,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 12:57:08,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681522849] [2019-12-07 12:57:08,615 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:08,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347701804] [2019-12-07 12:57:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:08,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227169123] [2019-12-07 12:57:08,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:08,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:08,616 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-12-07 12:57:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:08,679 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-12-07 12:57:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:08,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-12-07 12:57:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:08,694 INFO L225 Difference]: With dead ends: 5743 [2019-12-07 12:57:08,694 INFO L226 Difference]: Without dead ends: 3786 [2019-12-07 12:57:08,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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 12:57:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-12-07 12:57:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-12-07 12:57:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 12:57:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-12-07 12:57:08,777 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-12-07 12:57:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:08,778 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-12-07 12:57:08,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-12-07 12:57:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-12-07 12:57:08,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:08,784 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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 12:57:08,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:08,985 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-12-07 12:57:08,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:08,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496749014] [2019-12-07 12:57:08,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:08,992 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:08,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247429094] [2019-12-07 12:57:08,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:09,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:57:09,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 12:57:09,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496749014] [2019-12-07 12:57:09,085 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:09,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247429094] [2019-12-07 12:57:09,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:09,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:09,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141956438] [2019-12-07 12:57:09,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:09,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:09,086 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-12-07 12:57:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:09,295 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-12-07 12:57:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:09,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-12-07 12:57:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:09,314 INFO L225 Difference]: With dead ends: 7651 [2019-12-07 12:57:09,315 INFO L226 Difference]: Without dead ends: 3874 [2019-12-07 12:57:09,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 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 12:57:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-12-07 12:57:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-12-07 12:57:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 12:57:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-12-07 12:57:09,422 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-12-07 12:57:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:09,422 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-12-07 12:57:09,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-12-07 12:57:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-12-07 12:57:09,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:09,429 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:09,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:09,630 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-12-07 12:57:09,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:09,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027432919] [2019-12-07 12:57:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 12:57:09,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027432919] [2019-12-07 12:57:09,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:09,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:09,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349194221] [2019-12-07 12:57:09,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:09,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:09,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:09,677 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-12-07 12:57:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:09,849 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-12-07 12:57:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:09,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-12-07 12:57:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:09,864 INFO L225 Difference]: With dead ends: 7683 [2019-12-07 12:57:09,864 INFO L226 Difference]: Without dead ends: 3906 [2019-12-07 12:57:09,867 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 12:57:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-12-07 12:57:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-12-07 12:57:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 12:57:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-12-07 12:57:09,936 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-12-07 12:57:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:09,936 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-12-07 12:57:09,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-12-07 12:57:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-12-07 12:57:09,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:09,943 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 12:57:09,943 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-12-07 12:57:09,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:09,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066928420] [2019-12-07 12:57:09,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:09,952 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:09,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142531951] [2019-12-07 12:57:09,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:10,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:10,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 12:57:10,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066928420] [2019-12-07 12:57:10,057 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:10,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142531951] [2019-12-07 12:57:10,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:10,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:10,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143932550] [2019-12-07 12:57:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:10,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:10,058 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-12-07 12:57:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:10,215 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-12-07 12:57:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:10,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-12-07 12:57:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:10,230 INFO L225 Difference]: With dead ends: 7561 [2019-12-07 12:57:10,230 INFO L226 Difference]: Without dead ends: 3784 [2019-12-07 12:57:10,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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 12:57:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-12-07 12:57:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-12-07 12:57:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 12:57:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-12-07 12:57:10,296 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-12-07 12:57:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:10,297 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-12-07 12:57:10,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-12-07 12:57:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 12:57:10,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:10,301 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-12-07 12:57:10,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:10,502 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-12-07 12:57:10,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:10,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079505642] [2019-12-07 12:57:10,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:10,510 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 12:57:10,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476245995] [2019-12-07 12:57:10,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:10,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:57:10,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-12-07 12:57:10,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079505642] [2019-12-07 12:57:10,617 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:57:10,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476245995] [2019-12-07 12:57:10,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:10,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:10,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753966132] [2019-12-07 12:57:10,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:10,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:10,618 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-12-07 12:57:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:10,759 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-12-07 12:57:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:10,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-12-07 12:57:10,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:10,763 INFO L225 Difference]: With dead ends: 7951 [2019-12-07 12:57:10,764 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 12:57:10,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 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 12:57:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 12:57:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-12-07 12:57:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-12-07 12:57:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-12-07 12:57:10,801 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-12-07 12:57:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-12-07 12:57:10,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-12-07 12:57:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-12-07 12:57:10,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:10,805 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:11,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:11,006 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-12-07 12:57:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:11,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549400343] [2019-12-07 12:57:11,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-12-07 12:57:11,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549400343] [2019-12-07 12:57:11,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:11,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:11,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350499648] [2019-12-07 12:57:11,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:11,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:11,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:11,220 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-12-07 12:57:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:11,308 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-12-07 12:57:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:11,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-12-07 12:57:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:11,312 INFO L225 Difference]: With dead ends: 4829 [2019-12-07 12:57:11,312 INFO L226 Difference]: Without dead ends: 2529 [2019-12-07 12:57:11,314 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 12:57:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-12-07 12:57:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-12-07 12:57:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-12-07 12:57:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-12-07 12:57:11,345 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-12-07 12:57:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:11,346 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-12-07 12:57:11,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-12-07 12:57:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-12-07 12:57:11,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:11,349 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:11,349 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-12-07 12:57:11,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:11,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924985089] [2019-12-07 12:57:11,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-12-07 12:57:11,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924985089] [2019-12-07 12:57:11,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:11,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:11,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728282255] [2019-12-07 12:57:11,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:11,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:11,424 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-12-07 12:57:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:11,527 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-12-07 12:57:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:11,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-12-07 12:57:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:11,530 INFO L225 Difference]: With dead ends: 4949 [2019-12-07 12:57:11,531 INFO L226 Difference]: Without dead ends: 2499 [2019-12-07 12:57:11,533 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 12:57:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-12-07 12:57:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-12-07 12:57:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-12-07 12:57:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-12-07 12:57:11,564 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-12-07 12:57:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:11,565 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-12-07 12:57:11,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-12-07 12:57:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-12-07 12:57:11,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:11,568 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:11,568 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-12-07 12:57:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:11,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552926440] [2019-12-07 12:57:11,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 12:57:11,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552926440] [2019-12-07 12:57:11,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849849182] [2019-12-07 12:57:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:11,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:11,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 12:57:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:57:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:57:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212123871] [2019-12-07 12:57:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:57:11,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:57:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:57:11,816 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-12-07 12:57:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:12,032 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-12-07 12:57:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:57:12,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-12-07 12:57:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:12,039 INFO L225 Difference]: With dead ends: 7213 [2019-12-07 12:57:12,040 INFO L226 Difference]: Without dead ends: 4617 [2019-12-07 12:57:12,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 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 12:57:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-12-07 12:57:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-12-07 12:57:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-07 12:57:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-12-07 12:57:12,092 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-12-07 12:57:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:12,092 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-12-07 12:57:12,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:57:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-12-07 12:57:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-12-07 12:57:12,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:12,096 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:12,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:12,297 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-12-07 12:57:12,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:12,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417915779] [2019-12-07 12:57:12,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-12-07 12:57:12,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417915779] [2019-12-07 12:57:12,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:12,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:12,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866539623] [2019-12-07 12:57:12,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:12,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:12,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:12,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:12,473 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-12-07 12:57:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:12,572 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-12-07 12:57:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:12,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-12-07 12:57:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:12,576 INFO L225 Difference]: With dead ends: 5073 [2019-12-07 12:57:12,576 INFO L226 Difference]: Without dead ends: 2546 [2019-12-07 12:57:12,578 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 12:57:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-12-07 12:57:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-12-07 12:57:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-07 12:57:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-12-07 12:57:12,613 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-12-07 12:57:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:12,613 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-12-07 12:57:12,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-12-07 12:57:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-12-07 12:57:12,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:12,617 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:12,617 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-12-07 12:57:12,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:12,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520584061] [2019-12-07 12:57:12,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-12-07 12:57:12,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520584061] [2019-12-07 12:57:12,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:12,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:12,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391428483] [2019-12-07 12:57:12,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:12,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:12,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:12,735 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-12-07 12:57:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:12,842 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-12-07 12:57:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:12,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-12-07 12:57:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:12,845 INFO L225 Difference]: With dead ends: 5277 [2019-12-07 12:57:12,846 INFO L226 Difference]: Without dead ends: 2750 [2019-12-07 12:57:12,847 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 12:57:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-12-07 12:57:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-12-07 12:57:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-12-07 12:57:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-12-07 12:57:12,884 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-12-07 12:57:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:12,884 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-12-07 12:57:12,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-12-07 12:57:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-12-07 12:57:12,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:12,888 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:12,889 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-12-07 12:57:12,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:12,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870677725] [2019-12-07 12:57:12,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-12-07 12:57:13,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870677725] [2019-12-07 12:57:13,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:13,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:57:13,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334964581] [2019-12-07 12:57:13,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:57:13,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:57:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:57:13,035 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-12-07 12:57:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:13,135 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-12-07 12:57:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:57:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-12-07 12:57:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:13,138 INFO L225 Difference]: With dead ends: 5697 [2019-12-07 12:57:13,138 INFO L226 Difference]: Without dead ends: 2966 [2019-12-07 12:57:13,140 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 12:57:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-12-07 12:57:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-12-07 12:57:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-12-07 12:57:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-12-07 12:57:13,176 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-12-07 12:57:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:13,176 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-12-07 12:57:13,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:57:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-12-07 12:57:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-12-07 12:57:13,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:13,180 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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 12:57:13,181 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-12-07 12:57:13,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:13,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187050276] [2019-12-07 12:57:13,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 12:57:13,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187050276] [2019-12-07 12:57:13,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340194411] [2019-12-07 12:57:13,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:13,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:13,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 12:57:13,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:57:13,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 12:57:13,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097659873] [2019-12-07 12:57:13,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:57:13,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:57:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:57:13,664 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-12-07 12:57:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:13,778 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-12-07 12:57:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:57:13,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-12-07 12:57:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:13,779 INFO L225 Difference]: With dead ends: 4704 [2019-12-07 12:57:13,779 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:57:13,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 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 12:57:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:57:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:57:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:57:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:57:13,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-12-07 12:57:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:13,782 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:57:13,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:57:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:57:13,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:57:13,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:13,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:57:14,559 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-12-07 12:57:14,802 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 12:57:14,954 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-07 12:57:15,063 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 12:57:15,180 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 12:57:15,307 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-07 12:57:15,431 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-07 12:57:15,570 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 12:57:15,673 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 12:57:15,808 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 12:57:15,923 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-12-07 12:57:16,058 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 12:57:16,292 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-07 12:57:16,401 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 12:57:16,578 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-12-07 12:57:16,747 INFO L246 CegarLoopResult]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L242 CegarLoopResult]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-12-07 12:57:16,748 INFO L242 CegarLoopResult]: At program point L103(lines 102 625) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-12-07 12:57:16,748 INFO L246 CegarLoopResult]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-12-07 12:57:16,749 INFO L246 CegarLoopResult]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-12-07 12:57:16,749 INFO L246 CegarLoopResult]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-12-07 12:57:16,749 INFO L242 CegarLoopResult]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 12:57:16,749 INFO L242 CegarLoopResult]: At program point L172(lines 168 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,749 INFO L242 CegarLoopResult]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-12-07 12:57:16,749 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 12:57:16,749 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-12-07 12:57:16,749 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L242 CegarLoopResult]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 12:57:16,750 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L249 CegarLoopResult]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L249 CegarLoopResult]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-12-07 12:57:16,751 INFO L242 CegarLoopResult]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,751 INFO L242 CegarLoopResult]: At program point L145(lines 141 612) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L242 CegarLoopResult]: At program point L212(lines 105 624) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-12-07 12:57:16,752 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L242 CegarLoopResult]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,753 INFO L242 CegarLoopResult]: At program point L151(lines 147 610) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-12-07 12:57:16,753 INFO L242 CegarLoopResult]: At program point L121(lines 117 620) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-12-07 12:57:16,753 INFO L242 CegarLoopResult]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L249 CegarLoopResult]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:57:16,754 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L242 CegarLoopResult]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-12-07 12:57:16,755 INFO L242 CegarLoopResult]: At program point L157(lines 153 608) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 12:57:16,755 INFO L242 CegarLoopResult]: At program point L124(lines 123 618) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L242 CegarLoopResult]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-12-07 12:57:16,755 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L249 CegarLoopResult]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L242 CegarLoopResult]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,756 INFO L242 CegarLoopResult]: At program point L163(lines 159 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,756 INFO L246 CegarLoopResult]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-12-07 12:57:16,757 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,757 INFO L246 CegarLoopResult]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-12-07 12:57:16,758 INFO L246 CegarLoopResult]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-12-07 12:57:16,758 INFO L246 CegarLoopResult]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-12-07 12:57:16,758 INFO L246 CegarLoopResult]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-12-07 12:57:16,758 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 12:57:16,758 INFO L242 CegarLoopResult]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:57:16,758 INFO L242 CegarLoopResult]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 12:57:16,758 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 12:57:16,758 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-12-07 12:57:16,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:57:16 BoogieIcfgContainer [2019-12-07 12:57:16,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:57:16,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:57:16,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:57:16,793 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:57:16,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:57:04" (3/4) ... [2019-12-07 12:57:16,796 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:57:16,811 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:57:16,812 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:57:16,892 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ad858976-c5fa-4c5c-acb5-888fd9690110/bin/uautomizer/witness.graphml [2019-12-07 12:57:16,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:57:16,894 INFO L168 Benchmark]: Toolchain (without parser) took 12965.04 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 627.0 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -282.6 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,894 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:57:16,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:57:16,895 INFO L168 Benchmark]: Boogie Preprocessor took 24.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,895 INFO L168 Benchmark]: RCFGBuilder took 405.97 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: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,895 INFO L168 Benchmark]: TraceAbstraction took 12145.36 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 472.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -159.3 MB). Peak memory consumption was 701.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,895 INFO L168 Benchmark]: Witness Printer took 99.61 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:57:16,897 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -204.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.97 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: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12145.36 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 472.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -159.3 MB). Peak memory consumption was 701.3 MB. Max. memory is 11.5 GB. * Witness Printer took 99.61 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 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 correct! Received shutdown request...