./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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 bb19220a89a4de9b41ceda2b5f420af7272fc928 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:11,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:11,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:11,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:11,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:11,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:11,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:11,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:11,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:11,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:11,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:11,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:11,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:11,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:11,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:11,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:11,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:11,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:11,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:11,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:11,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:11,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:11,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:11,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:11,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:11,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:11,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:11,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:11,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:11,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:11,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:11,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:11,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:11,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:11,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:11,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:11,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:11,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:11,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:11,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:11,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:11,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:11,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:11,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:11,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:11,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:11,289 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:11,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:11,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:11,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:11,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:11,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:11,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:11,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:11,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:11,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:11,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:11,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:11,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:11,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:11,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:11,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:11,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:11,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:11,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:11,293 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_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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 -> bb19220a89a4de9b41ceda2b5f420af7272fc928 [2019-11-25 08:56:11,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:11,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:11,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:11,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:11,459 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:11,460 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-25 08:56:11,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/data/5d0b76244/2f5416f45f3445acb47981c75f792737/FLAG53f0c1a18 [2019-11-25 08:56:11,884 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:11,889 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2019-11-25 08:56:11,904 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/data/5d0b76244/2f5416f45f3445acb47981c75f792737/FLAG53f0c1a18 [2019-11-25 08:56:12,230 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/data/5d0b76244/2f5416f45f3445acb47981c75f792737 [2019-11-25 08:56:12,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:12,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:12,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:12,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:12,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:12,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a12c687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12, skipping insertion in model container [2019-11-25 08:56:12,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:12,280 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:12,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:12,550 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:12,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:12,614 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:12,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12 WrapperNode [2019-11-25 08:56:12,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:12,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:12,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:12,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:12,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:12,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:12,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:12,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:12,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... [2019-11-25 08:56:12,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:12,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:12,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:12,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:12,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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-11-25 08:56:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:12,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:12,964 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:56:13,407 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:56:13,408 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:56:13,409 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:13,409 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:13,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:13 BoogieIcfgContainer [2019-11-25 08:56:13,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:13,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:13,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:13,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:13,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:12" (1/3) ... [2019-11-25 08:56:13,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f014498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:13, skipping insertion in model container [2019-11-25 08:56:13,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:12" (2/3) ... [2019-11-25 08:56:13,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f014498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:13, skipping insertion in model container [2019-11-25 08:56:13,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:13" (3/3) ... [2019-11-25 08:56:13,419 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2019-11-25 08:56:13,427 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:13,431 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:13,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:13,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:13,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:13,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:13,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:13,461 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:13,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:13,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:13,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-25 08:56:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:56:13,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:13,483 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] [2019-11-25 08:56:13,484 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:13,487 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-25 08:56:13,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:13,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775880561] [2019-11-25 08:56:13,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:13,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775880561] [2019-11-25 08:56:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:13,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:13,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003250800] [2019-11-25 08:56:13,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:13,689 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-25 08:56:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:13,916 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-25 08:56:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:13,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:56:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:13,929 INFO L225 Difference]: With dead ends: 246 [2019-11-25 08:56:13,929 INFO L226 Difference]: Without dead ends: 112 [2019-11-25 08:56:13,932 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-11-25 08:56:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-25 08:56:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-25 08:56:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-25 08:56:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-25 08:56:13,987 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-25 08:56:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:13,987 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-25 08:56:13,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-25 08:56:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:56:13,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:13,989 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:13,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-25 08:56:13,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:13,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278484720] [2019-11-25 08:56:13,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278484720] [2019-11-25 08:56:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325693700] [2019-11-25 08:56:14,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:14,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:14,071 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-25 08:56:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:14,242 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-25 08:56:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:56:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:14,245 INFO L225 Difference]: With dead ends: 232 [2019-11-25 08:56:14,246 INFO L226 Difference]: Without dead ends: 130 [2019-11-25 08:56:14,247 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-11-25 08:56:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-25 08:56:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-25 08:56:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-25 08:56:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-25 08:56:14,272 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-25 08:56:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:14,272 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-25 08:56:14,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-25 08:56:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:56:14,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:14,275 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:14,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-25 08:56:14,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:14,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735104498] [2019-11-25 08:56:14,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:56:14,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735104498] [2019-11-25 08:56:14,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:14,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:14,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017158446] [2019-11-25 08:56:14,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:14,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:14,371 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-25 08:56:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:14,521 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-25 08:56:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:14,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:56:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:14,525 INFO L225 Difference]: With dead ends: 265 [2019-11-25 08:56:14,526 INFO L226 Difference]: Without dead ends: 148 [2019-11-25 08:56:14,526 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-11-25 08:56:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-25 08:56:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-25 08:56:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 08:56:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-25 08:56:14,542 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-25 08:56:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:14,542 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-25 08:56:14,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-25 08:56:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:56:14,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:14,546 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2019-11-25 08:56:14,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-25 08:56:14,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:14,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132870516] [2019-11-25 08:56:14,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:56:14,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132870516] [2019-11-25 08:56:14,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:14,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:14,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340474690] [2019-11-25 08:56:14,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:14,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:14,671 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 3 states. [2019-11-25 08:56:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:14,713 INFO L93 Difference]: Finished difference Result 410 states and 605 transitions. [2019-11-25 08:56:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:14,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:56:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:14,717 INFO L225 Difference]: With dead ends: 410 [2019-11-25 08:56:14,717 INFO L226 Difference]: Without dead ends: 276 [2019-11-25 08:56:14,718 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-11-25 08:56:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-25 08:56:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-11-25 08:56:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-25 08:56:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 405 transitions. [2019-11-25 08:56:14,754 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 405 transitions. Word has length 67 [2019-11-25 08:56:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:14,757 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 405 transitions. [2019-11-25 08:56:14,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 405 transitions. [2019-11-25 08:56:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:56:14,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:14,764 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:14,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash 625494152, now seen corresponding path program 1 times [2019-11-25 08:56:14,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:14,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555360730] [2019-11-25 08:56:14,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:56:14,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555360730] [2019-11-25 08:56:14,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:14,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561006865] [2019-11-25 08:56:14,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:14,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:14,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:14,893 INFO L87 Difference]: Start difference. First operand 276 states and 405 transitions. Second operand 3 states. [2019-11-25 08:56:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:15,087 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2019-11-25 08:56:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:15,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:56:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:15,091 INFO L225 Difference]: With dead ends: 590 [2019-11-25 08:56:15,093 INFO L226 Difference]: Without dead ends: 324 [2019-11-25 08:56:15,094 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-11-25 08:56:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-25 08:56:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 318. [2019-11-25 08:56:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-25 08:56:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 457 transitions. [2019-11-25 08:56:15,120 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 457 transitions. Word has length 85 [2019-11-25 08:56:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:15,120 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 457 transitions. [2019-11-25 08:56:15,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 457 transitions. [2019-11-25 08:56:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:56:15,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:15,123 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:15,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash 743834560, now seen corresponding path program 1 times [2019-11-25 08:56:15,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:15,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117544055] [2019-11-25 08:56:15,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:56:15,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117544055] [2019-11-25 08:56:15,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:15,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:15,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224233267] [2019-11-25 08:56:15,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:15,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:15,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:15,202 INFO L87 Difference]: Start difference. First operand 318 states and 457 transitions. Second operand 3 states. [2019-11-25 08:56:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:15,249 INFO L93 Difference]: Finished difference Result 473 states and 680 transitions. [2019-11-25 08:56:15,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:15,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:56:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:15,253 INFO L225 Difference]: With dead ends: 473 [2019-11-25 08:56:15,254 INFO L226 Difference]: Without dead ends: 471 [2019-11-25 08:56:15,254 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-11-25 08:56:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-25 08:56:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-11-25 08:56:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-25 08:56:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 678 transitions. [2019-11-25 08:56:15,287 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 678 transitions. Word has length 105 [2019-11-25 08:56:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:15,288 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 678 transitions. [2019-11-25 08:56:15,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 678 transitions. [2019-11-25 08:56:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:56:15,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:15,291 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:15,291 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1167688199, now seen corresponding path program 1 times [2019-11-25 08:56:15,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:15,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515938777] [2019-11-25 08:56:15,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:56:15,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515938777] [2019-11-25 08:56:15,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:15,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:15,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079187382] [2019-11-25 08:56:15,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:15,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:15,358 INFO L87 Difference]: Start difference. First operand 471 states and 678 transitions. Second operand 3 states. [2019-11-25 08:56:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:15,600 INFO L93 Difference]: Finished difference Result 1082 states and 1605 transitions. [2019-11-25 08:56:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:15,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:56:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:15,607 INFO L225 Difference]: With dead ends: 1082 [2019-11-25 08:56:15,607 INFO L226 Difference]: Without dead ends: 618 [2019-11-25 08:56:15,609 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-11-25 08:56:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-25 08:56:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 594. [2019-11-25 08:56:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-25 08:56:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2019-11-25 08:56:15,642 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 123 [2019-11-25 08:56:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:15,643 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2019-11-25 08:56:15,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2019-11-25 08:56:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-25 08:56:15,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:15,647 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-25 08:56:15,647 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -266344288, now seen corresponding path program 1 times [2019-11-25 08:56:15,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:15,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409608415] [2019-11-25 08:56:15,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-25 08:56:15,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409608415] [2019-11-25 08:56:15,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:15,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:15,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036414748] [2019-11-25 08:56:15,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:15,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:15,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:15,746 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2019-11-25 08:56:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:15,944 INFO L93 Difference]: Finished difference Result 1456 states and 2204 transitions. [2019-11-25 08:56:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:15,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-25 08:56:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:15,949 INFO L225 Difference]: With dead ends: 1456 [2019-11-25 08:56:15,950 INFO L226 Difference]: Without dead ends: 821 [2019-11-25 08:56:15,951 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-11-25 08:56:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-25 08:56:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 783. [2019-11-25 08:56:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-11-25 08:56:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1128 transitions. [2019-11-25 08:56:15,974 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1128 transitions. Word has length 149 [2019-11-25 08:56:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:15,974 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1128 transitions. [2019-11-25 08:56:15,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1128 transitions. [2019-11-25 08:56:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-25 08:56:15,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:15,977 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1] [2019-11-25 08:56:15,977 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -466571119, now seen corresponding path program 1 times [2019-11-25 08:56:15,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:15,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646931217] [2019-11-25 08:56:15,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-25 08:56:16,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646931217] [2019-11-25 08:56:16,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:16,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:16,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271840835] [2019-11-25 08:56:16,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:16,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:16,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:16,047 INFO L87 Difference]: Start difference. First operand 783 states and 1128 transitions. Second operand 3 states. [2019-11-25 08:56:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:16,217 INFO L93 Difference]: Finished difference Result 1712 states and 2481 transitions. [2019-11-25 08:56:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:16,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-25 08:56:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:16,223 INFO L225 Difference]: With dead ends: 1712 [2019-11-25 08:56:16,223 INFO L226 Difference]: Without dead ends: 894 [2019-11-25 08:56:16,225 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-11-25 08:56:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-25 08:56:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 858. [2019-11-25 08:56:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-11-25 08:56:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1224 transitions. [2019-11-25 08:56:16,252 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1224 transitions. Word has length 170 [2019-11-25 08:56:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:16,253 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1224 transitions. [2019-11-25 08:56:16,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1224 transitions. [2019-11-25 08:56:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-25 08:56:16,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:16,256 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:16,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1681812864, now seen corresponding path program 1 times [2019-11-25 08:56:16,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:16,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670239482] [2019-11-25 08:56:16,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-25 08:56:16,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670239482] [2019-11-25 08:56:16,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:16,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:16,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282180930] [2019-11-25 08:56:16,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:16,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:16,366 INFO L87 Difference]: Start difference. First operand 858 states and 1224 transitions. Second operand 3 states. [2019-11-25 08:56:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:16,553 INFO L93 Difference]: Finished difference Result 1862 states and 2673 transitions. [2019-11-25 08:56:16,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:16,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-25 08:56:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:16,559 INFO L225 Difference]: With dead ends: 1862 [2019-11-25 08:56:16,559 INFO L226 Difference]: Without dead ends: 987 [2019-11-25 08:56:16,561 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-11-25 08:56:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-25 08:56:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 951. [2019-11-25 08:56:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-25 08:56:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1356 transitions. [2019-11-25 08:56:16,592 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1356 transitions. Word has length 194 [2019-11-25 08:56:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:16,592 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1356 transitions. [2019-11-25 08:56:16,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1356 transitions. [2019-11-25 08:56:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-25 08:56:16,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:16,596 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-25 08:56:16,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1348358718, now seen corresponding path program 1 times [2019-11-25 08:56:16,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:16,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603474626] [2019-11-25 08:56:16,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-25 08:56:16,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603474626] [2019-11-25 08:56:16,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:16,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:16,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414906030] [2019-11-25 08:56:16,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:16,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:16,685 INFO L87 Difference]: Start difference. First operand 951 states and 1356 transitions. Second operand 3 states. [2019-11-25 08:56:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:16,719 INFO L93 Difference]: Finished difference Result 2833 states and 4038 transitions. [2019-11-25 08:56:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:16,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-25 08:56:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:16,730 INFO L225 Difference]: With dead ends: 2833 [2019-11-25 08:56:16,730 INFO L226 Difference]: Without dead ends: 1892 [2019-11-25 08:56:16,732 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-11-25 08:56:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-11-25 08:56:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2019-11-25 08:56:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-11-25 08:56:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2693 transitions. [2019-11-25 08:56:16,784 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2693 transitions. Word has length 224 [2019-11-25 08:56:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:16,784 INFO L462 AbstractCegarLoop]: Abstraction has 1890 states and 2693 transitions. [2019-11-25 08:56:16,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2693 transitions. [2019-11-25 08:56:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-25 08:56:16,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:16,789 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-11-25 08:56:16,789 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 132204992, now seen corresponding path program 1 times [2019-11-25 08:56:16,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:16,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036471891] [2019-11-25 08:56:16,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-25 08:56:16,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036471891] [2019-11-25 08:56:16,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:16,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:16,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194906885] [2019-11-25 08:56:16,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:16,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:16,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:16,866 INFO L87 Difference]: Start difference. First operand 1890 states and 2693 transitions. Second operand 3 states. [2019-11-25 08:56:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:17,081 INFO L93 Difference]: Finished difference Result 4076 states and 5839 transitions. [2019-11-25 08:56:17,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:17,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-25 08:56:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:17,093 INFO L225 Difference]: With dead ends: 4076 [2019-11-25 08:56:17,093 INFO L226 Difference]: Without dead ends: 2166 [2019-11-25 08:56:17,095 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-11-25 08:56:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-25 08:56:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2100. [2019-11-25 08:56:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-25 08:56:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3005 transitions. [2019-11-25 08:56:17,164 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3005 transitions. Word has length 224 [2019-11-25 08:56:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:17,164 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3005 transitions. [2019-11-25 08:56:17,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3005 transitions. [2019-11-25 08:56:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-25 08:56:17,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:17,172 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:17,172 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash 912871510, now seen corresponding path program 1 times [2019-11-25 08:56:17,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:17,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485991783] [2019-11-25 08:56:17,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-11-25 08:56:17,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485991783] [2019-11-25 08:56:17,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:17,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:17,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725465801] [2019-11-25 08:56:17,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:17,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:17,301 INFO L87 Difference]: Start difference. First operand 2100 states and 3005 transitions. Second operand 3 states. [2019-11-25 08:56:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:17,487 INFO L93 Difference]: Finished difference Result 4256 states and 6073 transitions. [2019-11-25 08:56:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:17,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-25 08:56:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:17,499 INFO L225 Difference]: With dead ends: 4256 [2019-11-25 08:56:17,500 INFO L226 Difference]: Without dead ends: 2148 [2019-11-25 08:56:17,502 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-11-25 08:56:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-25 08:56:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2082. [2019-11-25 08:56:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-25 08:56:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2951 transitions. [2019-11-25 08:56:17,559 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2951 transitions. Word has length 259 [2019-11-25 08:56:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:17,559 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2951 transitions. [2019-11-25 08:56:17,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2951 transitions. [2019-11-25 08:56:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-25 08:56:17,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:17,567 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:17,567 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1837028224, now seen corresponding path program 1 times [2019-11-25 08:56:17,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:17,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413238445] [2019-11-25 08:56:17,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-11-25 08:56:17,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413238445] [2019-11-25 08:56:17,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:17,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:17,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483122151] [2019-11-25 08:56:17,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:17,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:17,733 INFO L87 Difference]: Start difference. First operand 2082 states and 2951 transitions. Second operand 3 states. [2019-11-25 08:56:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:17,805 INFO L93 Difference]: Finished difference Result 6211 states and 8802 transitions. [2019-11-25 08:56:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:17,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-25 08:56:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:17,827 INFO L225 Difference]: With dead ends: 6211 [2019-11-25 08:56:17,827 INFO L226 Difference]: Without dead ends: 4139 [2019-11-25 08:56:17,831 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-11-25 08:56:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-11-25 08:56:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4137. [2019-11-25 08:56:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-25 08:56:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5847 transitions. [2019-11-25 08:56:17,990 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5847 transitions. Word has length 269 [2019-11-25 08:56:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:17,991 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5847 transitions. [2019-11-25 08:56:17,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5847 transitions. [2019-11-25 08:56:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-25 08:56:18,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:18,000 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:18,001 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1739569540, now seen corresponding path program 1 times [2019-11-25 08:56:18,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:18,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987939061] [2019-11-25 08:56:18,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:18,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987939061] [2019-11-25 08:56:18,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:18,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:18,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204715969] [2019-11-25 08:56:18,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:18,120 INFO L87 Difference]: Start difference. First operand 4137 states and 5847 transitions. Second operand 3 states. [2019-11-25 08:56:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:18,345 INFO L93 Difference]: Finished difference Result 8369 states and 11808 transitions. [2019-11-25 08:56:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:18,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-25 08:56:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:18,367 INFO L225 Difference]: With dead ends: 8369 [2019-11-25 08:56:18,367 INFO L226 Difference]: Without dead ends: 4245 [2019-11-25 08:56:18,374 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-11-25 08:56:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2019-11-25 08:56:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4137. [2019-11-25 08:56:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-11-25 08:56:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5739 transitions. [2019-11-25 08:56:18,480 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5739 transitions. Word has length 269 [2019-11-25 08:56:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:18,480 INFO L462 AbstractCegarLoop]: Abstraction has 4137 states and 5739 transitions. [2019-11-25 08:56:18,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5739 transitions. [2019-11-25 08:56:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-25 08:56:18,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:18,490 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:18,491 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash 938764333, now seen corresponding path program 1 times [2019-11-25 08:56:18,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:18,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587916596] [2019-11-25 08:56:18,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-25 08:56:18,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587916596] [2019-11-25 08:56:18,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:18,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:18,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847791906] [2019-11-25 08:56:18,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:18,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:18,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:18,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:18,606 INFO L87 Difference]: Start difference. First operand 4137 states and 5739 transitions. Second operand 3 states. [2019-11-25 08:56:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:18,845 INFO L93 Difference]: Finished difference Result 8855 states and 12162 transitions. [2019-11-25 08:56:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:18,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-11-25 08:56:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:18,870 INFO L225 Difference]: With dead ends: 8855 [2019-11-25 08:56:18,870 INFO L226 Difference]: Without dead ends: 4731 [2019-11-25 08:56:18,876 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-11-25 08:56:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-25 08:56:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4311. [2019-11-25 08:56:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-25 08:56:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5973 transitions. [2019-11-25 08:56:19,064 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5973 transitions. Word has length 296 [2019-11-25 08:56:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:19,065 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5973 transitions. [2019-11-25 08:56:19,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5973 transitions. [2019-11-25 08:56:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-25 08:56:19,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:19,074 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:19,075 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1894222412, now seen corresponding path program 1 times [2019-11-25 08:56:19,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:19,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991734380] [2019-11-25 08:56:19,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-25 08:56:19,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991734380] [2019-11-25 08:56:19,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:19,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:19,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518357806] [2019-11-25 08:56:19,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:19,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:19,182 INFO L87 Difference]: Start difference. First operand 4311 states and 5973 transitions. Second operand 3 states. [2019-11-25 08:56:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:19,378 INFO L93 Difference]: Finished difference Result 8933 states and 12252 transitions. [2019-11-25 08:56:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:19,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-11-25 08:56:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:19,402 INFO L225 Difference]: With dead ends: 8933 [2019-11-25 08:56:19,409 INFO L226 Difference]: Without dead ends: 4131 [2019-11-25 08:56:19,415 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-11-25 08:56:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2019-11-25 08:56:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4113. [2019-11-25 08:56:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4113 states. [2019-11-25 08:56:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 5679 transitions. [2019-11-25 08:56:19,501 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 5679 transitions. Word has length 297 [2019-11-25 08:56:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:19,502 INFO L462 AbstractCegarLoop]: Abstraction has 4113 states and 5679 transitions. [2019-11-25 08:56:19,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 5679 transitions. [2019-11-25 08:56:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-25 08:56:19,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:19,512 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:19,512 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1483906000, now seen corresponding path program 1 times [2019-11-25 08:56:19,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:19,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624864216] [2019-11-25 08:56:19,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624864216] [2019-11-25 08:56:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027269918] [2019-11-25 08:56:19,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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-11-25 08:56:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:19,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:56:19,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2019-11-25 08:56:19,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:19,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:56:19,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021483340] [2019-11-25 08:56:19,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:19,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:19,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:19,986 INFO L87 Difference]: Start difference. First operand 4113 states and 5679 transitions. Second operand 3 states. [2019-11-25 08:56:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:20,039 INFO L93 Difference]: Finished difference Result 6199 states and 8538 transitions. [2019-11-25 08:56:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:20,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-25 08:56:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:20,047 INFO L225 Difference]: With dead ends: 6199 [2019-11-25 08:56:20,048 INFO L226 Difference]: Without dead ends: 4115 [2019-11-25 08:56:20,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-11-25 08:56:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4101. [2019-11-25 08:56:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-11-25 08:56:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5643 transitions. [2019-11-25 08:56:20,138 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5643 transitions. Word has length 307 [2019-11-25 08:56:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:20,138 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5643 transitions. [2019-11-25 08:56:20,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5643 transitions. [2019-11-25 08:56:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-25 08:56:20,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:20,148 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:20,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:20,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash -321532334, now seen corresponding path program 1 times [2019-11-25 08:56:20,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:20,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920176806] [2019-11-25 08:56:20,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:20,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920176806] [2019-11-25 08:56:20,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446064472] [2019-11-25 08:56:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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-11-25 08:56:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:20,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:56:20,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:20,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:20,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:56:20,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652855667] [2019-11-25 08:56:20,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:20,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:20,728 INFO L87 Difference]: Start difference. First operand 4101 states and 5643 transitions. Second operand 4 states. [2019-11-25 08:56:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:21,111 INFO L93 Difference]: Finished difference Result 7278 states and 10118 transitions. [2019-11-25 08:56:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:21,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-25 08:56:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:21,122 INFO L225 Difference]: With dead ends: 7278 [2019-11-25 08:56:21,122 INFO L226 Difference]: Without dead ends: 5086 [2019-11-25 08:56:21,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 309 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-11-25 08:56:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2019-11-25 08:56:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4274. [2019-11-25 08:56:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-11-25 08:56:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5908 transitions. [2019-11-25 08:56:21,295 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5908 transitions. Word has length 307 [2019-11-25 08:56:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:21,296 INFO L462 AbstractCegarLoop]: Abstraction has 4274 states and 5908 transitions. [2019-11-25 08:56:21,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5908 transitions. [2019-11-25 08:56:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-25 08:56:21,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:21,305 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:21,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:21,509 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1368718125, now seen corresponding path program 1 times [2019-11-25 08:56:21,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397580811] [2019-11-25 08:56:21,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:21,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397580811] [2019-11-25 08:56:21,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022942586] [2019-11-25 08:56:21,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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-11-25 08:56:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:21,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:56:21,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:56:21,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:21,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:56:21,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58392866] [2019-11-25 08:56:21,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:21,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:21,820 INFO L87 Difference]: Start difference. First operand 4274 states and 5908 transitions. Second operand 4 states. [2019-11-25 08:56:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:22,065 INFO L93 Difference]: Finished difference Result 5429 states and 7539 transitions. [2019-11-25 08:56:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:22,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-25 08:56:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:22,070 INFO L225 Difference]: With dead ends: 5429 [2019-11-25 08:56:22,070 INFO L226 Difference]: Without dead ends: 2207 [2019-11-25 08:56:22,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-11-25 08:56:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-11-25 08:56:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-11-25 08:56:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-11-25 08:56:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3065 transitions. [2019-11-25 08:56:22,124 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3065 transitions. Word has length 308 [2019-11-25 08:56:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:22,124 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 3065 transitions. [2019-11-25 08:56:22,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3065 transitions. [2019-11-25 08:56:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-25 08:56:22,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:22,131 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-11-25 08:56:22,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:22,335 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1115026887, now seen corresponding path program 1 times [2019-11-25 08:56:22,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:22,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599605679] [2019-11-25 08:56:22,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-25 08:56:22,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599605679] [2019-11-25 08:56:22,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780699442] [2019-11-25 08:56:22,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/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-11-25 08:56:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:22,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:56:22,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-11-25 08:56:22,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:22,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:56:22,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545193792] [2019-11-25 08:56:22,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:22,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:22,707 INFO L87 Difference]: Start difference. First operand 2207 states and 3065 transitions. Second operand 4 states. [2019-11-25 08:56:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:22,951 INFO L93 Difference]: Finished difference Result 3153 states and 4322 transitions. [2019-11-25 08:56:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:22,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-25 08:56:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:22,952 INFO L225 Difference]: With dead ends: 3153 [2019-11-25 08:56:22,952 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:56:22,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 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-11-25 08:56:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:56:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:56:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:56:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:56:22,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-11-25 08:56:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:22,956 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:56:22,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:56:22,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:56:23,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:23,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:56:23,626 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 3 [2019-11-25 08:56:23,797 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-25 08:56:24,257 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-25 08:56:24,260 INFO L447 ceAbstractionStarter]: At program point L630(lines 622 632) the Hoare annotation is: true [2019-11-25 08:56:24,260 INFO L444 ceAbstractionStarter]: For program point L300(lines 300 304) no Hoare annotation was computed. [2019-11-25 08:56:24,260 INFO L444 ceAbstractionStarter]: For program point L300-2(lines 300 304) no Hoare annotation was computed. [2019-11-25 08:56:24,260 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 549) no Hoare annotation was computed. [2019-11-25 08:56:24,260 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 560) no Hoare annotation was computed. [2019-11-25 08:56:24,260 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 571) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L433-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L447 ceAbstractionStarter]: At program point L202(lines 201 538) the Hoare annotation is: true [2019-11-25 08:56:24,261 INFO L440 ceAbstractionStarter]: At program point L169(lines 165 550) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,261 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 571) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 407) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L402-2(lines 402 407) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 548) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 559) no Hoare annotation was computed. [2019-11-25 08:56:24,261 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 570) no Hoare annotation was computed. [2019-11-25 08:56:24,262 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 560) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,263 INFO L440 ceAbstractionStarter]: At program point L536(lines 99 602) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4))) (or (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0) (and (not .cse1) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse4 .cse1 .cse5) (<= ULTIMATE.start_ssl3_connect_~s__state~0 3) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5) (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)))) [2019-11-25 08:56:24,263 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-25 08:56:24,263 INFO L447 ceAbstractionStarter]: At program point L603(lines 98 604) the Hoare annotation is: true [2019-11-25 08:56:24,263 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 547) no Hoare annotation was computed. [2019-11-25 08:56:24,263 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 558) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 569) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 377) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L373-2(lines 373 377) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L440 ceAbstractionStarter]: At program point L208(lines 105 570) the Hoare annotation is: (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) [2019-11-25 08:56:24,264 INFO L440 ceAbstractionStarter]: At program point L175(lines 171 548) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 600) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 597) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,264 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L309-1(lines 309 323) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 546) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 557) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 568) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L607(lines 607 611) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 583) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L607-2(lines 607 611) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L574-2(lines 573 595) no Hoare annotation was computed. [2019-11-25 08:56:24,265 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 558) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,265 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 449) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 545) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 556) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L213-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 567) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L313-2(lines 311 323) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L440 ceAbstractionStarter]: At program point L181(lines 177 546) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L512-1(lines 512 516) no Hoare annotation was computed. [2019-11-25 08:56:24,266 INFO L444 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 544) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 555) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 566) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 66 620) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 556) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 487) no Hoare annotation was computed. [2019-11-25 08:56:24,267 INFO L444 ceAbstractionStarter]: For program point L483-2(lines 483 487) no Hoare annotation was computed. [2019-11-25 08:56:24,268 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 293) no Hoare annotation was computed. [2019-11-25 08:56:24,268 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 543) no Hoare annotation was computed. [2019-11-25 08:56:24,268 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 554) no Hoare annotation was computed. [2019-11-25 08:56:24,268 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 565) no Hoare annotation was computed. [2019-11-25 08:56:24,268 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-25 08:56:24,270 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-11-25 08:56:24,270 INFO L440 ceAbstractionStarter]: At program point L187(lines 183 544) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0 .cse1))) [2019-11-25 08:56:24,270 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 566) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,270 INFO L440 ceAbstractionStarter]: At program point L353(lines 66 620) the Hoare annotation is: false [2019-11-25 08:56:24,270 INFO L447 ceAbstractionStarter]: At program point L618(lines 66 620) the Hoare annotation is: true [2019-11-25 08:56:24,270 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 591) no Hoare annotation was computed. [2019-11-25 08:56:24,270 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-25 08:56:24,271 INFO L444 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-25 08:56:24,271 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-11-25 08:56:24,271 INFO L444 ceAbstractionStarter]: For program point L288-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,271 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 542) no Hoare annotation was computed. [2019-11-25 08:56:24,271 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 553) no Hoare annotation was computed. [2019-11-25 08:56:24,272 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 564) no Hoare annotation was computed. [2019-11-25 08:56:24,272 INFO L447 ceAbstractionStarter]: At program point L619(lines 8 621) the Hoare annotation is: true [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 458) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 242) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 541) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 552) no Hoare annotation was computed. [2019-11-25 08:56:24,273 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,274 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 563) no Hoare annotation was computed. [2019-11-25 08:56:24,274 INFO L440 ceAbstractionStarter]: At program point L193(lines 189 542) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) [2019-11-25 08:56:24,274 INFO L440 ceAbstractionStarter]: At program point L127(lines 123 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,274 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:56:24,274 INFO L444 ceAbstractionStarter]: For program point L491-1(lines 491 503) no Hoare annotation was computed. [2019-11-25 08:56:24,274 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 429) no Hoare annotation was computed. [2019-11-25 08:56:24,274 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-25 08:56:24,275 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 540) no Hoare annotation was computed. [2019-11-25 08:56:24,275 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 551) no Hoare annotation was computed. [2019-11-25 08:56:24,275 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 562) no Hoare annotation was computed. [2019-11-25 08:56:24,275 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-25 08:56:24,275 INFO L440 ceAbstractionStarter]: At program point L196(lines 195 540) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3) (and .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse3))) [2019-11-25 08:56:24,275 INFO L440 ceAbstractionStarter]: At program point L163(lines 153 554) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,275 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 499) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L461-1(lines 461 472) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 267) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L263-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 614) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-25 08:56:24,276 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L330-2(lines 203 535) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 539) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 550) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 561) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 66 620) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 469) no Hoare annotation was computed. [2019-11-25 08:56:24,277 INFO L447 ceAbstractionStarter]: At program point L199(lines 198 539) the Hoare annotation is: true [2019-11-25 08:56:24,278 INFO L440 ceAbstractionStarter]: At program point L133(lines 129 562) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:56:24,278 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-25 08:56:24,278 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-25 08:56:24,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:24 BoogieIcfgContainer [2019-11-25 08:56:24,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:24,306 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:24,306 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:24,307 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:24,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:13" (3/4) ... [2019-11-25 08:56:24,310 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:56:24,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:56:24,333 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:56:24,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_328c5c96-eb03-4407-b3cf-cd1a7f7ef4ca/bin/uautomizer/witness.graphml [2019-11-25 08:56:24,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:24,469 INFO L168 Benchmark]: Toolchain (without parser) took 12236.04 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 652.2 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -328.6 MB). Peak memory consumption was 323.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,470 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:24,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,471 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,471 INFO L168 Benchmark]: RCFGBuilder took 709.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,471 INFO L168 Benchmark]: TraceAbstraction took 10894.57 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.5 MB). Peak memory consumption was 298.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,472 INFO L168 Benchmark]: Witness Printer took 162.21 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:24,474 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 709.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10894.57 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.5 MB). Peak memory consumption was 298.7 MB. Max. memory is 11.5 GB. * Witness Printer took 162.21 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 614]: 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: 171]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((4416 == s__state && blastFlag <= 4) || ((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state)) || blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || s__state <= 3) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(0 == s__hit) && blastFlag <= 4) && 4432 <= s__state) || ((s__state <= 4560 && blastFlag <= 4) && 4432 <= s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (0 == s__hit && 4432 <= s__state) || (4560 <= s__state && blastFlag <= 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((!(0 == s__hit) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && blastFlag <= 4) && 4352 <= s__state) || (((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: SAFE, OverallTime: 10.8s, OverallIterations: 21, TraceHistogramMax: 15, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 4033 SDtfs, 1585 SDslu, 2268 SDs, 0 SdLazy, 1977 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1323 GetRequests, 1294 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4311occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 1655 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 191 NumberOfFragments, 280 HoareAnnotationTreeSize, 23 FomulaSimplifications, 14412 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 8920 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5351 NumberOfCodeBlocks, 5351 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023446 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 16460/16530 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...