./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/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 bde6b0d7476cc0073434242dc88ffbb328415efe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:43:12,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:43:12,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:43:12,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:43:12,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:43:12,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:43:12,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:43:12,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:43:12,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:43:12,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:43:12,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:43:12,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:43:12,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:43:12,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:43:12,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:43:12,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:43:12,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:43:12,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:43:12,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:43:12,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:43:12,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:43:12,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:43:12,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:43:12,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:43:12,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:43:12,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:43:12,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:43:12,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:43:12,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:43:12,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:43:12,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:43:12,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:43:12,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:43:12,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:43:12,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:43:12,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:43:12,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:43:12,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:43:12,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:43:12,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:43:12,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:43:12,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:43:12,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:43:12,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:43:12,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:43:12,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:43:12,252 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:43:12,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:43:12,252 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:43:12,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:43:12,253 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:43:12,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:43:12,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:43:12,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:43:12,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:43:12,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:43:12,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:43:12,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:43:12,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:43:12,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:43:12,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:43:12,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:43:12,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:43:12,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:43:12,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:43:12,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:43:12,257 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_c3cb361a-271e-43bf-a6e3-878d6545ae39/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 -> bde6b0d7476cc0073434242dc88ffbb328415efe [2019-12-07 18:43:12,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:43:12,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:43:12,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:43:12,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:43:12,388 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:43:12,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c [2019-12-07 18:43:12,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/data/a5e97c4da/6b084cd38f7c4698b95e4e16b0a5420d/FLAG3631688a6 [2019-12-07 18:43:12,856 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:43:12,857 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c [2019-12-07 18:43:12,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/data/a5e97c4da/6b084cd38f7c4698b95e4e16b0a5420d/FLAG3631688a6 [2019-12-07 18:43:12,876 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/data/a5e97c4da/6b084cd38f7c4698b95e4e16b0a5420d [2019-12-07 18:43:12,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:43:12,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:43:12,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:43:12,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:43:12,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:43:12,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:43:12" (1/1) ... [2019-12-07 18:43:12,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:12, skipping insertion in model container [2019-12-07 18:43:12,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:43:12" (1/1) ... [2019-12-07 18:43:12,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:43:12,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:43:13,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:43:13,105 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:43:13,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:43:13,160 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:43:13,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13 WrapperNode [2019-12-07 18:43:13,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:43:13,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:43:13,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:43:13,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:43:13,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:43:13,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:43:13,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:43:13,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:43:13,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... [2019-12-07 18:43:13,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:43:13,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:43:13,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:43:13,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:43:13,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:43:13,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:43:13,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:43:13,335 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:43:13,633 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 18:43:13,633 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 18:43:13,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:43:13,634 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:43:13,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:43:13 BoogieIcfgContainer [2019-12-07 18:43:13,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:43:13,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:43:13,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:43:13,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:43:13,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:43:12" (1/3) ... [2019-12-07 18:43:13,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e863bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:43:13, skipping insertion in model container [2019-12-07 18:43:13,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:43:13" (2/3) ... [2019-12-07 18:43:13,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e863bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:43:13, skipping insertion in model container [2019-12-07 18:43:13,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:43:13" (3/3) ... [2019-12-07 18:43:13,639 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-12-07 18:43:13,646 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:43:13,650 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:43:13,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:43:13,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:43:13,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:43:13,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:43:13,675 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:43:13,675 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:43:13,675 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:43:13,675 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:43:13,675 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:43:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 18:43:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:43:13,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:13,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:13,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times [2019-12-07 18:43:13,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:13,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229113204] [2019-12-07 18:43:13,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:13,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229113204] [2019-12-07 18:43:13,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:13,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:13,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037432608] [2019-12-07 18:43:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:13,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:13,864 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-12-07 18:43:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,005 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2019-12-07 18:43:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:43:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,014 INFO L225 Difference]: With dead ends: 328 [2019-12-07 18:43:14,015 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 18:43:14,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 18:43:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2019-12-07 18:43:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:43:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2019-12-07 18:43:14,055 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32 [2019-12-07 18:43:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,056 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2019-12-07 18:43:14,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2019-12-07 18:43:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:43:14,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,058 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times [2019-12-07 18:43:14,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655068136] [2019-12-07 18:43:14,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655068136] [2019-12-07 18:43:14,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277888802] [2019-12-07 18:43:14,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,109 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states. [2019-12-07 18:43:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,221 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions. [2019-12-07 18:43:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 18:43:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,223 INFO L225 Difference]: With dead ends: 350 [2019-12-07 18:43:14,223 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 18:43:14,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 18:43:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-12-07 18:43:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-12-07 18:43:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions. [2019-12-07 18:43:14,234 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33 [2019-12-07 18:43:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,235 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions. [2019-12-07 18:43:14,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions. [2019-12-07 18:43:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:43:14,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,236 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times [2019-12-07 18:43:14,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863639080] [2019-12-07 18:43:14,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863639080] [2019-12-07 18:43:14,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644510757] [2019-12-07 18:43:14,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,283 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states. [2019-12-07 18:43:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,411 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions. [2019-12-07 18:43:14,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:43:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,414 INFO L225 Difference]: With dead ends: 411 [2019-12-07 18:43:14,414 INFO L226 Difference]: Without dead ends: 231 [2019-12-07 18:43:14,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-07 18:43:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-12-07 18:43:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-12-07 18:43:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions. [2019-12-07 18:43:14,426 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39 [2019-12-07 18:43:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,426 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions. [2019-12-07 18:43:14,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions. [2019-12-07 18:43:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:43:14,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,429 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times [2019-12-07 18:43:14,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867603744] [2019-12-07 18:43:14,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867603744] [2019-12-07 18:43:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289558048] [2019-12-07 18:43:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,470 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states. [2019-12-07 18:43:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,583 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions. [2019-12-07 18:43:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 18:43:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,585 INFO L225 Difference]: With dead ends: 460 [2019-12-07 18:43:14,585 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:43:14,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:43:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-12-07 18:43:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 18:43:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions. [2019-12-07 18:43:14,594 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40 [2019-12-07 18:43:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,595 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions. [2019-12-07 18:43:14,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions. [2019-12-07 18:43:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:43:14,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times [2019-12-07 18:43:14,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222644264] [2019-12-07 18:43:14,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222644264] [2019-12-07 18:43:14,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567188884] [2019-12-07 18:43:14,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,629 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states. [2019-12-07 18:43:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,719 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions. [2019-12-07 18:43:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 18:43:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,721 INFO L225 Difference]: With dead ends: 504 [2019-12-07 18:43:14,721 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 18:43:14,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 18:43:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-12-07 18:43:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 18:43:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions. [2019-12-07 18:43:14,730 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58 [2019-12-07 18:43:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,730 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions. [2019-12-07 18:43:14,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions. [2019-12-07 18:43:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:43:14,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times [2019-12-07 18:43:14,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48470605] [2019-12-07 18:43:14,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48470605] [2019-12-07 18:43:14,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820347935] [2019-12-07 18:43:14,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,761 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states. [2019-12-07 18:43:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,850 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions. [2019-12-07 18:43:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 18:43:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,852 INFO L225 Difference]: With dead ends: 529 [2019-12-07 18:43:14,852 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 18:43:14,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 18:43:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-12-07 18:43:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-12-07 18:43:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2019-12-07 18:43:14,859 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59 [2019-12-07 18:43:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,859 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2019-12-07 18:43:14,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2019-12-07 18:43:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 18:43:14,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,860 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,860 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times [2019-12-07 18:43:14,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122699140] [2019-12-07 18:43:14,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:14,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122699140] [2019-12-07 18:43:14,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:14,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:14,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846429792] [2019-12-07 18:43:14,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:14,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,883 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states. [2019-12-07 18:43:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:14,968 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-12-07 18:43:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:14,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 18:43:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:14,971 INFO L225 Difference]: With dead ends: 546 [2019-12-07 18:43:14,971 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 18:43:14,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 18:43:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-12-07 18:43:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 18:43:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions. [2019-12-07 18:43:14,982 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60 [2019-12-07 18:43:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:14,982 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions. [2019-12-07 18:43:14,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions. [2019-12-07 18:43:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:43:14,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:14,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:14,984 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times [2019-12-07 18:43:14,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:14,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122337637] [2019-12-07 18:43:14,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:15,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122337637] [2019-12-07 18:43:15,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474717073] [2019-12-07 18:43:15,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,011 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states. [2019-12-07 18:43:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,095 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-12-07 18:43:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 18:43:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,097 INFO L225 Difference]: With dead ends: 594 [2019-12-07 18:43:15,097 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 18:43:15,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 18:43:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-12-07 18:43:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-07 18:43:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions. [2019-12-07 18:43:15,105 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72 [2019-12-07 18:43:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,105 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions. [2019-12-07 18:43:15,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions. [2019-12-07 18:43:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:43:15,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,106 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times [2019-12-07 18:43:15,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453449266] [2019-12-07 18:43:15,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:15,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453449266] [2019-12-07 18:43:15,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704791994] [2019-12-07 18:43:15,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,130 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states. [2019-12-07 18:43:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,233 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions. [2019-12-07 18:43:15,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 18:43:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,235 INFO L225 Difference]: With dead ends: 645 [2019-12-07 18:43:15,235 INFO L226 Difference]: Without dead ends: 345 [2019-12-07 18:43:15,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-07 18:43:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-12-07 18:43:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 18:43:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions. [2019-12-07 18:43:15,243 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72 [2019-12-07 18:43:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,243 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions. [2019-12-07 18:43:15,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions. [2019-12-07 18:43:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:43:15,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,244 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times [2019-12-07 18:43:15,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288232937] [2019-12-07 18:43:15,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:15,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288232937] [2019-12-07 18:43:15,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740692869] [2019-12-07 18:43:15,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,266 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states. [2019-12-07 18:43:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,346 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions. [2019-12-07 18:43:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 18:43:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,348 INFO L225 Difference]: With dead ends: 681 [2019-12-07 18:43:15,348 INFO L226 Difference]: Without dead ends: 345 [2019-12-07 18:43:15,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-07 18:43:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-12-07 18:43:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 18:43:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions. [2019-12-07 18:43:15,357 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73 [2019-12-07 18:43:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,357 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions. [2019-12-07 18:43:15,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions. [2019-12-07 18:43:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:43:15,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,358 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times [2019-12-07 18:43:15,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094819695] [2019-12-07 18:43:15,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:43:15,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094819695] [2019-12-07 18:43:15,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116306815] [2019-12-07 18:43:15,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,382 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states. [2019-12-07 18:43:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,502 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions. [2019-12-07 18:43:15,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 18:43:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,505 INFO L225 Difference]: With dead ends: 681 [2019-12-07 18:43:15,505 INFO L226 Difference]: Without dead ends: 345 [2019-12-07 18:43:15,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-07 18:43:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-12-07 18:43:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 18:43:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-12-07 18:43:15,517 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73 [2019-12-07 18:43:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,518 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-12-07 18:43:15,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-12-07 18:43:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 18:43:15,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,519 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,519 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times [2019-12-07 18:43:15,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527074250] [2019-12-07 18:43:15,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:43:15,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527074250] [2019-12-07 18:43:15,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673005387] [2019-12-07 18:43:15,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,549 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states. [2019-12-07 18:43:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,641 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2019-12-07 18:43:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-07 18:43:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,643 INFO L225 Difference]: With dead ends: 708 [2019-12-07 18:43:15,643 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 18:43:15,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 18:43:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-12-07 18:43:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-12-07 18:43:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions. [2019-12-07 18:43:15,652 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79 [2019-12-07 18:43:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,652 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions. [2019-12-07 18:43:15,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions. [2019-12-07 18:43:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 18:43:15,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,653 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,653 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times [2019-12-07 18:43:15,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436929465] [2019-12-07 18:43:15,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:43:15,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436929465] [2019-12-07 18:43:15,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871199959] [2019-12-07 18:43:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,675 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states. [2019-12-07 18:43:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,761 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions. [2019-12-07 18:43:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-07 18:43:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,763 INFO L225 Difference]: With dead ends: 732 [2019-12-07 18:43:15,763 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 18:43:15,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 18:43:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-12-07 18:43:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-12-07 18:43:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions. [2019-12-07 18:43:15,772 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80 [2019-12-07 18:43:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,772 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions. [2019-12-07 18:43:15,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions. [2019-12-07 18:43:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 18:43:15,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,773 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,773 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times [2019-12-07 18:43:15,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962336391] [2019-12-07 18:43:15,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 18:43:15,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962336391] [2019-12-07 18:43:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739745605] [2019-12-07 18:43:15,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,795 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states. [2019-12-07 18:43:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:15,872 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2019-12-07 18:43:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 18:43:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:15,875 INFO L225 Difference]: With dead ends: 736 [2019-12-07 18:43:15,875 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 18:43:15,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 18:43:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-12-07 18:43:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-07 18:43:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2019-12-07 18:43:15,888 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85 [2019-12-07 18:43:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:15,889 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2019-12-07 18:43:15,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2019-12-07 18:43:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:43:15,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:15,890 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:15,890 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times [2019-12-07 18:43:15,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:15,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267523074] [2019-12-07 18:43:15,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:15,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267523074] [2019-12-07 18:43:15,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:15,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:15,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317980294] [2019-12-07 18:43:15,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:15,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:15,916 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states. [2019-12-07 18:43:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,023 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions. [2019-12-07 18:43:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 18:43:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,025 INFO L225 Difference]: With dead ends: 776 [2019-12-07 18:43:16,025 INFO L226 Difference]: Without dead ends: 407 [2019-12-07 18:43:16,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-07 18:43:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-12-07 18:43:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 18:43:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions. [2019-12-07 18:43:16,036 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86 [2019-12-07 18:43:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,036 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions. [2019-12-07 18:43:16,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions. [2019-12-07 18:43:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:43:16,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,037 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:16,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,038 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times [2019-12-07 18:43:16,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618251510] [2019-12-07 18:43:16,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:16,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618251510] [2019-12-07 18:43:16,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374886616] [2019-12-07 18:43:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,057 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states. [2019-12-07 18:43:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,158 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions. [2019-12-07 18:43:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-07 18:43:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,160 INFO L225 Difference]: With dead ends: 805 [2019-12-07 18:43:16,160 INFO L226 Difference]: Without dead ends: 407 [2019-12-07 18:43:16,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-07 18:43:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-12-07 18:43:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 18:43:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions. [2019-12-07 18:43:16,170 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87 [2019-12-07 18:43:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,170 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions. [2019-12-07 18:43:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions. [2019-12-07 18:43:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:43:16,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,171 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:43:16,172 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times [2019-12-07 18:43:16,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647220404] [2019-12-07 18:43:16,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 18:43:16,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647220404] [2019-12-07 18:43:16,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870723375] [2019-12-07 18:43:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,192 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states. [2019-12-07 18:43:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,289 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions. [2019-12-07 18:43:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 18:43:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,291 INFO L225 Difference]: With dead ends: 828 [2019-12-07 18:43:16,291 INFO L226 Difference]: Without dead ends: 430 [2019-12-07 18:43:16,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-07 18:43:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-12-07 18:43:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 18:43:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions. [2019-12-07 18:43:16,303 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100 [2019-12-07 18:43:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,304 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions. [2019-12-07 18:43:16,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions. [2019-12-07 18:43:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:43:16,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,305 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:43:16,305 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times [2019-12-07 18:43:16,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776105252] [2019-12-07 18:43:16,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 18:43:16,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776105252] [2019-12-07 18:43:16,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343699624] [2019-12-07 18:43:16,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,332 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states. [2019-12-07 18:43:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,419 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions. [2019-12-07 18:43:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-07 18:43:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,421 INFO L225 Difference]: With dead ends: 849 [2019-12-07 18:43:16,421 INFO L226 Difference]: Without dead ends: 430 [2019-12-07 18:43:16,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-07 18:43:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-12-07 18:43:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 18:43:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2019-12-07 18:43:16,431 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101 [2019-12-07 18:43:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,431 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2019-12-07 18:43:16,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2019-12-07 18:43:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:43:16,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,432 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:16,433 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times [2019-12-07 18:43:16,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457680059] [2019-12-07 18:43:16,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:16,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457680059] [2019-12-07 18:43:16,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195988070] [2019-12-07 18:43:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,454 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states. [2019-12-07 18:43:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,558 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions. [2019-12-07 18:43:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 18:43:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,560 INFO L225 Difference]: With dead ends: 890 [2019-12-07 18:43:16,560 INFO L226 Difference]: Without dead ends: 471 [2019-12-07 18:43:16,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-07 18:43:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2019-12-07 18:43:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-07 18:43:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions. [2019-12-07 18:43:16,570 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102 [2019-12-07 18:43:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,570 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions. [2019-12-07 18:43:16,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions. [2019-12-07 18:43:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 18:43:16,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,571 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:16,571 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times [2019-12-07 18:43:16,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562110512] [2019-12-07 18:43:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 18:43:16,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562110512] [2019-12-07 18:43:16,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409809377] [2019-12-07 18:43:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,592 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states. [2019-12-07 18:43:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,687 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions. [2019-12-07 18:43:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 18:43:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,689 INFO L225 Difference]: With dead ends: 965 [2019-12-07 18:43:16,689 INFO L226 Difference]: Without dead ends: 504 [2019-12-07 18:43:16,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-07 18:43:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-12-07 18:43:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-12-07 18:43:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions. [2019-12-07 18:43:16,700 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103 [2019-12-07 18:43:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,700 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions. [2019-12-07 18:43:16,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions. [2019-12-07 18:43:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 18:43:16,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,701 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:16,701 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times [2019-12-07 18:43:16,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145983589] [2019-12-07 18:43:16,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:43:16,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145983589] [2019-12-07 18:43:16,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461774339] [2019-12-07 18:43:16,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,723 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states. [2019-12-07 18:43:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,823 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions. [2019-12-07 18:43:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 18:43:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,825 INFO L225 Difference]: With dead ends: 1004 [2019-12-07 18:43:16,825 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 18:43:16,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 18:43:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-12-07 18:43:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 18:43:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions. [2019-12-07 18:43:16,836 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103 [2019-12-07 18:43:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,837 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions. [2019-12-07 18:43:16,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions. [2019-12-07 18:43:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 18:43:16,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,838 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:16,838 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times [2019-12-07 18:43:16,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292548261] [2019-12-07 18:43:16,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 18:43:16,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292548261] [2019-12-07 18:43:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:16,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247587542] [2019-12-07 18:43:16,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,858 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states. [2019-12-07 18:43:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:16,951 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions. [2019-12-07 18:43:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:16,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 18:43:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:16,954 INFO L225 Difference]: With dead ends: 1003 [2019-12-07 18:43:16,954 INFO L226 Difference]: Without dead ends: 506 [2019-12-07 18:43:16,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-07 18:43:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-12-07 18:43:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 18:43:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions. [2019-12-07 18:43:16,965 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104 [2019-12-07 18:43:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:16,965 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions. [2019-12-07 18:43:16,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions. [2019-12-07 18:43:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 18:43:16,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:16,966 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 18:43:16,967 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times [2019-12-07 18:43:16,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:16,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26312299] [2019-12-07 18:43:16,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 18:43:16,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26312299] [2019-12-07 18:43:16,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:16,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:16,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118226222] [2019-12-07 18:43:16,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:16,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:16,991 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states. [2019-12-07 18:43:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,016 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions. [2019-12-07 18:43:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 18:43:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,022 INFO L225 Difference]: With dead ends: 1491 [2019-12-07 18:43:17,022 INFO L226 Difference]: Without dead ends: 994 [2019-12-07 18:43:17,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-12-07 18:43:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505. [2019-12-07 18:43:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-12-07 18:43:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2019-12-07 18:43:17,054 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116 [2019-12-07 18:43:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,055 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2019-12-07 18:43:17,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2019-12-07 18:43:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 18:43:17,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,056 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 18:43:17,057 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times [2019-12-07 18:43:17,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681169460] [2019-12-07 18:43:17,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 18:43:17,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681169460] [2019-12-07 18:43:17,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:17,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:17,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893340076] [2019-12-07 18:43:17,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:17,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:17,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:17,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,098 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states. [2019-12-07 18:43:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,148 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions. [2019-12-07 18:43:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 18:43:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,154 INFO L225 Difference]: With dead ends: 1499 [2019-12-07 18:43:17,154 INFO L226 Difference]: Without dead ends: 1001 [2019-12-07 18:43:17,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-07 18:43:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-12-07 18:43:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-12-07 18:43:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions. [2019-12-07 18:43:17,189 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116 [2019-12-07 18:43:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,189 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions. [2019-12-07 18:43:17,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions. [2019-12-07 18:43:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 18:43:17,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,192 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2019-12-07 18:43:17,192 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times [2019-12-07 18:43:17,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535808569] [2019-12-07 18:43:17,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-07 18:43:17,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535808569] [2019-12-07 18:43:17,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:17,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:17,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943050813] [2019-12-07 18:43:17,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,232 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states. [2019-12-07 18:43:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,300 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions. [2019-12-07 18:43:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-12-07 18:43:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,308 INFO L225 Difference]: With dead ends: 2493 [2019-12-07 18:43:17,309 INFO L226 Difference]: Without dead ends: 1499 [2019-12-07 18:43:17,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-12-07 18:43:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-12-07 18:43:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-07 18:43:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions. [2019-12-07 18:43:17,343 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118 [2019-12-07 18:43:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,343 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions. [2019-12-07 18:43:17,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions. [2019-12-07 18:43:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 18:43:17,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,345 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2019-12-07 18:43:17,345 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times [2019-12-07 18:43:17,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230031348] [2019-12-07 18:43:17,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 18:43:17,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230031348] [2019-12-07 18:43:17,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:17,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490009080] [2019-12-07 18:43:17,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:17,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,377 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states. [2019-12-07 18:43:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,444 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions. [2019-12-07 18:43:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-12-07 18:43:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,454 INFO L225 Difference]: With dead ends: 1997 [2019-12-07 18:43:17,454 INFO L226 Difference]: Without dead ends: 1995 [2019-12-07 18:43:17,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-12-07 18:43:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2019-12-07 18:43:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-07 18:43:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions. [2019-12-07 18:43:17,506 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119 [2019-12-07 18:43:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions. [2019-12-07 18:43:17,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions. [2019-12-07 18:43:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 18:43:17,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:17,509 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times [2019-12-07 18:43:17,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044192742] [2019-12-07 18:43:17,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-07 18:43:17,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044192742] [2019-12-07 18:43:17,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:17,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:17,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141693440] [2019-12-07 18:43:17,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:17,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:17,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,543 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states. [2019-12-07 18:43:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,675 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions. [2019-12-07 18:43:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-12-07 18:43:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,683 INFO L225 Difference]: With dead ends: 4167 [2019-12-07 18:43:17,683 INFO L226 Difference]: Without dead ends: 2181 [2019-12-07 18:43:17,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-12-07 18:43:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157. [2019-12-07 18:43:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-12-07 18:43:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions. [2019-12-07 18:43:17,743 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149 [2019-12-07 18:43:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,743 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions. [2019-12-07 18:43:17,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions. [2019-12-07 18:43:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 18:43:17,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,746 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:17,746 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times [2019-12-07 18:43:17,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961046699] [2019-12-07 18:43:17,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-07 18:43:17,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961046699] [2019-12-07 18:43:17,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:17,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:43:17,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673605356] [2019-12-07 18:43:17,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:17,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,794 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states. [2019-12-07 18:43:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:17,940 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions. [2019-12-07 18:43:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:17,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-12-07 18:43:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:17,949 INFO L225 Difference]: With dead ends: 4331 [2019-12-07 18:43:17,949 INFO L226 Difference]: Without dead ends: 2149 [2019-12-07 18:43:17,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2019-12-07 18:43:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125. [2019-12-07 18:43:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-07 18:43:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions. [2019-12-07 18:43:17,995 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150 [2019-12-07 18:43:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:17,995 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions. [2019-12-07 18:43:17,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions. [2019-12-07 18:43:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 18:43:17,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:17,998 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:17,999 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times [2019-12-07 18:43:17,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725305928] [2019-12-07 18:43:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 18:43:18,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725305928] [2019-12-07 18:43:18,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537965276] [2019-12-07 18:43:18,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:18,108 INFO L264 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:43:18,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-07 18:43:18,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:43:18,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:43:18,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484810551] [2019-12-07 18:43:18,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:18,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:18,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:18,171 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 3 states. [2019-12-07 18:43:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:18,272 INFO L93 Difference]: Finished difference Result 4774 states and 7050 transitions. [2019-12-07 18:43:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:18,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-12-07 18:43:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:18,284 INFO L225 Difference]: With dead ends: 4774 [2019-12-07 18:43:18,285 INFO L226 Difference]: Without dead ends: 2656 [2019-12-07 18:43:18,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-12-07 18:43:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-12-07 18:43:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654. [2019-12-07 18:43:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-07 18:43:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3900 transitions. [2019-12-07 18:43:18,350 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3900 transitions. Word has length 182 [2019-12-07 18:43:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 3900 transitions. [2019-12-07 18:43:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3900 transitions. [2019-12-07 18:43:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 18:43:18,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:18,354 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2019-12-07 18:43:18,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:18,555 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times [2019-12-07 18:43:18,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:18,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063346285] [2019-12-07 18:43:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 18:43:18,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063346285] [2019-12-07 18:43:18,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:18,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:18,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080745644] [2019-12-07 18:43:18,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:18,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:18,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:18,601 INFO L87 Difference]: Start difference. First operand 2654 states and 3900 transitions. Second operand 3 states. [2019-12-07 18:43:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:18,690 INFO L93 Difference]: Finished difference Result 4243 states and 6236 transitions. [2019-12-07 18:43:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:18,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 18:43:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:18,706 INFO L225 Difference]: With dead ends: 4243 [2019-12-07 18:43:18,706 INFO L226 Difference]: Without dead ends: 3183 [2019-12-07 18:43:18,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2019-12-07 18:43:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2019-12-07 18:43:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-07 18:43:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4680 transitions. [2019-12-07 18:43:18,801 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4680 transitions. Word has length 186 [2019-12-07 18:43:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:18,801 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4680 transitions. [2019-12-07 18:43:18,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4680 transitions. [2019-12-07 18:43:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-12-07 18:43:18,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:18,807 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:18,807 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times [2019-12-07 18:43:18,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:18,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791812724] [2019-12-07 18:43:18,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-12-07 18:43:18,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791812724] [2019-12-07 18:43:18,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:18,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:18,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024546175] [2019-12-07 18:43:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:18,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:18,860 INFO L87 Difference]: Start difference. First operand 3183 states and 4680 transitions. Second operand 3 states. [2019-12-07 18:43:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:19,028 INFO L93 Difference]: Finished difference Result 6419 states and 9421 transitions. [2019-12-07 18:43:19,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:19,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-12-07 18:43:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:19,045 INFO L225 Difference]: With dead ends: 6419 [2019-12-07 18:43:19,045 INFO L226 Difference]: Without dead ends: 3243 [2019-12-07 18:43:19,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-12-07 18:43:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3183. [2019-12-07 18:43:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-07 18:43:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4632 transitions. [2019-12-07 18:43:19,120 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4632 transitions. Word has length 264 [2019-12-07 18:43:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:19,120 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4632 transitions. [2019-12-07 18:43:19,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4632 transitions. [2019-12-07 18:43:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-07 18:43:19,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:19,126 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:19,126 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times [2019-12-07 18:43:19,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:19,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825690398] [2019-12-07 18:43:19,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 18:43:19,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825690398] [2019-12-07 18:43:19,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:19,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:19,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877998309] [2019-12-07 18:43:19,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:19,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:19,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:19,185 INFO L87 Difference]: Start difference. First operand 3183 states and 4632 transitions. Second operand 3 states. [2019-12-07 18:43:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:19,346 INFO L93 Difference]: Finished difference Result 6455 states and 9367 transitions. [2019-12-07 18:43:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:19,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-12-07 18:43:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:19,354 INFO L225 Difference]: With dead ends: 6455 [2019-12-07 18:43:19,354 INFO L226 Difference]: Without dead ends: 3279 [2019-12-07 18:43:19,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2019-12-07 18:43:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3183. [2019-12-07 18:43:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-07 18:43:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4416 transitions. [2019-12-07 18:43:19,450 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4416 transitions. Word has length 268 [2019-12-07 18:43:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:19,450 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4416 transitions. [2019-12-07 18:43:19,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4416 transitions. [2019-12-07 18:43:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 18:43:19,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:19,457 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:19,457 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times [2019-12-07 18:43:19,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:19,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308805441] [2019-12-07 18:43:19,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-12-07 18:43:19,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308805441] [2019-12-07 18:43:19,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:19,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:19,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738598446] [2019-12-07 18:43:19,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:19,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:19,557 INFO L87 Difference]: Start difference. First operand 3183 states and 4416 transitions. Second operand 3 states. [2019-12-07 18:43:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:19,720 INFO L93 Difference]: Finished difference Result 6437 states and 8913 transitions. [2019-12-07 18:43:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:19,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-12-07 18:43:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:19,725 INFO L225 Difference]: With dead ends: 6437 [2019-12-07 18:43:19,725 INFO L226 Difference]: Without dead ends: 3261 [2019-12-07 18:43:19,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2019-12-07 18:43:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3183. [2019-12-07 18:43:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-07 18:43:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4260 transitions. [2019-12-07 18:43:19,792 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4260 transitions. Word has length 278 [2019-12-07 18:43:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:19,793 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4260 transitions. [2019-12-07 18:43:19,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4260 transitions. [2019-12-07 18:43:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-12-07 18:43:19,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:19,798 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-12-07 18:43:19,798 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158541, now seen corresponding path program 1 times [2019-12-07 18:43:19,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:19,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483172682] [2019-12-07 18:43:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-12-07 18:43:19,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483172682] [2019-12-07 18:43:19,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608222904] [2019-12-07 18:43:19,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:19,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:43:19,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-12-07 18:43:20,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:43:20,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:43:20,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916508830] [2019-12-07 18:43:20,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:20,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:20,024 INFO L87 Difference]: Start difference. First operand 3183 states and 4260 transitions. Second operand 3 states. [2019-12-07 18:43:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:20,126 INFO L93 Difference]: Finished difference Result 9373 states and 12524 transitions. [2019-12-07 18:43:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:20,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-12-07 18:43:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:20,134 INFO L225 Difference]: With dead ends: 9373 [2019-12-07 18:43:20,134 INFO L226 Difference]: Without dead ends: 6197 [2019-12-07 18:43:20,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 288 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-12-07 18:43:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-12-07 18:43:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6195. [2019-12-07 18:43:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6195 states. [2019-12-07 18:43:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6195 states to 6195 states and 8256 transitions. [2019-12-07 18:43:20,286 INFO L78 Accepts]: Start accepts. Automaton has 6195 states and 8256 transitions. Word has length 288 [2019-12-07 18:43:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:20,287 INFO L462 AbstractCegarLoop]: Abstraction has 6195 states and 8256 transitions. [2019-12-07 18:43:20,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6195 states and 8256 transitions. [2019-12-07 18:43:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-12-07 18:43:20,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:20,295 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-12-07 18:43:20,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:20,496 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2096858319, now seen corresponding path program 1 times [2019-12-07 18:43:20,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:20,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765205260] [2019-12-07 18:43:20,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-12-07 18:43:20,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765205260] [2019-12-07 18:43:20,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475328793] [2019-12-07 18:43:20,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:20,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:43:20,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-12-07 18:43:20,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:43:20,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:43:20,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802191242] [2019-12-07 18:43:20,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:43:20,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:43:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:43:20,697 INFO L87 Difference]: Start difference. First operand 6195 states and 8256 transitions. Second operand 4 states. [2019-12-07 18:43:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:21,092 INFO L93 Difference]: Finished difference Result 17795 states and 23500 transitions. [2019-12-07 18:43:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:43:21,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-12-07 18:43:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:21,107 INFO L225 Difference]: With dead ends: 17795 [2019-12-07 18:43:21,107 INFO L226 Difference]: Without dead ends: 11451 [2019-12-07 18:43:21,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states. [2019-12-07 18:43:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 6339. [2019-12-07 18:43:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-12-07 18:43:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 8448 transitions. [2019-12-07 18:43:21,321 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 8448 transitions. Word has length 288 [2019-12-07 18:43:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:21,322 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 8448 transitions. [2019-12-07 18:43:21,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:43:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 8448 transitions. [2019-12-07 18:43:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-12-07 18:43:21,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:21,330 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:21,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:21,531 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times [2019-12-07 18:43:21,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:21,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24115966] [2019-12-07 18:43:21,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-12-07 18:43:21,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24115966] [2019-12-07 18:43:21,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653085484] [2019-12-07 18:43:21,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:21,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:43:21,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-12-07 18:43:21,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:43:21,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:43:21,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507303603] [2019-12-07 18:43:21,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:43:21,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:43:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:43:21,725 INFO L87 Difference]: Start difference. First operand 6339 states and 8448 transitions. Second operand 4 states. [2019-12-07 18:43:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:22,053 INFO L93 Difference]: Finished difference Result 14214 states and 18779 transitions. [2019-12-07 18:43:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:43:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-12-07 18:43:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:22,062 INFO L225 Difference]: With dead ends: 14214 [2019-12-07 18:43:22,062 INFO L226 Difference]: Without dead ends: 7852 [2019-12-07 18:43:22,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states. [2019-12-07 18:43:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 6153. [2019-12-07 18:43:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-12-07 18:43:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8148 transitions. [2019-12-07 18:43:22,198 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8148 transitions. Word has length 297 [2019-12-07 18:43:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:22,199 INFO L462 AbstractCegarLoop]: Abstraction has 6153 states and 8148 transitions. [2019-12-07 18:43:22,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:43:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8148 transitions. [2019-12-07 18:43:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-12-07 18:43:22,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:22,205 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:22,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:22,406 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -231299850, now seen corresponding path program 1 times [2019-12-07 18:43:22,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:22,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937090655] [2019-12-07 18:43:22,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-12-07 18:43:22,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937090655] [2019-12-07 18:43:22,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:22,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:22,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467937021] [2019-12-07 18:43:22,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:22,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:22,573 INFO L87 Difference]: Start difference. First operand 6153 states and 8148 transitions. Second operand 3 states. [2019-12-07 18:43:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:22,748 INFO L93 Difference]: Finished difference Result 12695 states and 16825 transitions. [2019-12-07 18:43:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:22,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-12-07 18:43:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:22,754 INFO L225 Difference]: With dead ends: 12695 [2019-12-07 18:43:22,754 INFO L226 Difference]: Without dead ends: 6333 [2019-12-07 18:43:22,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2019-12-07 18:43:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 6333. [2019-12-07 18:43:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-12-07 18:43:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 8322 transitions. [2019-12-07 18:43:22,880 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 8322 transitions. Word has length 306 [2019-12-07 18:43:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:22,880 INFO L462 AbstractCegarLoop]: Abstraction has 6333 states and 8322 transitions. [2019-12-07 18:43:22,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 8322 transitions. [2019-12-07 18:43:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-12-07 18:43:22,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:22,886 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:43:22,886 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -707716365, now seen corresponding path program 1 times [2019-12-07 18:43:22,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:22,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201554924] [2019-12-07 18:43:22,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-12-07 18:43:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201554924] [2019-12-07 18:43:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119404475] [2019-12-07 18:43:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:23,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:43:23,046 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-12-07 18:43:23,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:43:23,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:43:23,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639428596] [2019-12-07 18:43:23,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:43:23,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:23,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:43:23,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:43:23,098 INFO L87 Difference]: Start difference. First operand 6333 states and 8322 transitions. Second operand 4 states. [2019-12-07 18:43:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:23,429 INFO L93 Difference]: Finished difference Result 13044 states and 16947 transitions. [2019-12-07 18:43:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:43:23,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-12-07 18:43:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:23,436 INFO L225 Difference]: With dead ends: 13044 [2019-12-07 18:43:23,436 INFO L226 Difference]: Without dead ends: 6718 [2019-12-07 18:43:23,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2019-12-07 18:43:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 4032. [2019-12-07 18:43:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-07 18:43:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5147 transitions. [2019-12-07 18:43:23,578 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5147 transitions. Word has length 318 [2019-12-07 18:43:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:23,578 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5147 transitions. [2019-12-07 18:43:23,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:43:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5147 transitions. [2019-12-07 18:43:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-12-07 18:43:23,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:23,583 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:23,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:23,783 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times [2019-12-07 18:43:23,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:23,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647187486] [2019-12-07 18:43:23,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-12-07 18:43:23,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647187486] [2019-12-07 18:43:23,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:23,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:23,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520898452] [2019-12-07 18:43:23,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:23,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:23,850 INFO L87 Difference]: Start difference. First operand 4032 states and 5147 transitions. Second operand 3 states. [2019-12-07 18:43:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:23,991 INFO L93 Difference]: Finished difference Result 8177 states and 10418 transitions. [2019-12-07 18:43:23,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:23,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-12-07 18:43:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:23,995 INFO L225 Difference]: With dead ends: 8177 [2019-12-07 18:43:23,996 INFO L226 Difference]: Without dead ends: 4152 [2019-12-07 18:43:23,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-12-07 18:43:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4032. [2019-12-07 18:43:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-07 18:43:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5069 transitions. [2019-12-07 18:43:24,077 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5069 transitions. Word has length 321 [2019-12-07 18:43:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:24,077 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5069 transitions. [2019-12-07 18:43:24,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5069 transitions. [2019-12-07 18:43:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-12-07 18:43:24,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:24,082 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:24,082 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:24,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1605204832, now seen corresponding path program 1 times [2019-12-07 18:43:24,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:24,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937087138] [2019-12-07 18:43:24,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-12-07 18:43:24,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937087138] [2019-12-07 18:43:24,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:24,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:24,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897486042] [2019-12-07 18:43:24,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:24,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,160 INFO L87 Difference]: Start difference. First operand 4032 states and 5069 transitions. Second operand 3 states. [2019-12-07 18:43:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:24,298 INFO L93 Difference]: Finished difference Result 7108 states and 8996 transitions. [2019-12-07 18:43:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-12-07 18:43:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:24,301 INFO L225 Difference]: With dead ends: 7108 [2019-12-07 18:43:24,301 INFO L226 Difference]: Without dead ends: 4088 [2019-12-07 18:43:24,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-12-07 18:43:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4032. [2019-12-07 18:43:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-07 18:43:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5063 transitions. [2019-12-07 18:43:24,378 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5063 transitions. Word has length 364 [2019-12-07 18:43:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:24,379 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5063 transitions. [2019-12-07 18:43:24,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5063 transitions. [2019-12-07 18:43:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-12-07 18:43:24,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:24,384 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:24,384 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times [2019-12-07 18:43:24,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:24,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508654930] [2019-12-07 18:43:24,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-12-07 18:43:24,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508654930] [2019-12-07 18:43:24,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:24,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:24,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773485192] [2019-12-07 18:43:24,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:24,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:24,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,502 INFO L87 Difference]: Start difference. First operand 4032 states and 5063 transitions. Second operand 3 states. [2019-12-07 18:43:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:24,653 INFO L93 Difference]: Finished difference Result 7064 states and 8910 transitions. [2019-12-07 18:43:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-12-07 18:43:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:24,657 INFO L225 Difference]: With dead ends: 7064 [2019-12-07 18:43:24,657 INFO L226 Difference]: Without dead ends: 4044 [2019-12-07 18:43:24,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2019-12-07 18:43:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 4032. [2019-12-07 18:43:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-12-07 18:43:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5057 transitions. [2019-12-07 18:43:24,732 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5057 transitions. Word has length 387 [2019-12-07 18:43:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:24,733 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5057 transitions. [2019-12-07 18:43:24,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5057 transitions. [2019-12-07 18:43:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-12-07 18:43:24,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:24,737 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:24,737 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times [2019-12-07 18:43:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:24,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442300823] [2019-12-07 18:43:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-12-07 18:43:24,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442300823] [2019-12-07 18:43:24,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:43:24,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:43:24,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583287986] [2019-12-07 18:43:24,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:43:24,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:43:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:43:24,824 INFO L87 Difference]: Start difference. First operand 4032 states and 5057 transitions. Second operand 3 states. [2019-12-07 18:43:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:24,946 INFO L93 Difference]: Finished difference Result 7517 states and 9443 transitions. [2019-12-07 18:43:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:43:24,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-12-07 18:43:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:24,949 INFO L225 Difference]: With dead ends: 7517 [2019-12-07 18:43:24,949 INFO L226 Difference]: Without dead ends: 3371 [2019-12-07 18:43:24,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-12-07 18:43:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-12-07 18:43:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3282. [2019-12-07 18:43:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-12-07 18:43:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4095 transitions. [2019-12-07 18:43:25,010 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4095 transitions. Word has length 387 [2019-12-07 18:43:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:25,010 INFO L462 AbstractCegarLoop]: Abstraction has 3282 states and 4095 transitions. [2019-12-07 18:43:25,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:43:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4095 transitions. [2019-12-07 18:43:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 18:43:25,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:43:25,014 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:43:25,014 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:43:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:43:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times [2019-12-07 18:43:25,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:43:25,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251974946] [2019-12-07 18:43:25,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:43:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 18:43:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251974946] [2019-12-07 18:43:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751205587] [2019-12-07 18:43:25,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:43:25,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:43:25,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:43:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 18:43:25,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:43:25,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:43:25,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719383054] [2019-12-07 18:43:25,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:43:25,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:43:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:43:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:43:25,333 INFO L87 Difference]: Start difference. First operand 3282 states and 4095 transitions. Second operand 4 states. [2019-12-07 18:43:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:43:25,491 INFO L93 Difference]: Finished difference Result 5377 states and 6760 transitions. [2019-12-07 18:43:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:43:25,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-12-07 18:43:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:43:25,492 INFO L225 Difference]: With dead ends: 5377 [2019-12-07 18:43:25,492 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:43:25,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:43:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:43:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:43:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:43:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:43:25,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2019-12-07 18:43:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:43:25,494 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:43:25,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:43:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:43:25,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:43:25,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:43:25,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:43:26,927 WARN L192 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-12-07 18:43:27,954 WARN L192 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 618 DAG size of output: 420 [2019-12-07 18:43:28,618 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2019-12-07 18:43:29,051 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-12-07 18:43:29,337 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 21 [2019-12-07 18:43:29,704 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 21 [2019-12-07 18:43:29,972 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-12-07 18:43:34,395 WARN L192 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 361 DAG size of output: 107 [2019-12-07 18:43:34,690 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-12-07 18:43:35,096 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-12-07 18:43:35,533 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 23 [2019-12-07 18:43:35,752 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2019-12-07 18:43:36,225 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2019-12-07 18:43:40,412 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 361 DAG size of output: 107 [2019-12-07 18:43:40,671 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 29 [2019-12-07 18:43:41,048 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-12-07 18:43:41,561 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-12-07 18:43:42,143 WARN L192 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-12-07 18:43:43,268 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 149 DAG size of output: 28 [2019-12-07 18:43:43,530 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2019-12-07 18:43:43,873 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-12-07 18:43:44,558 WARN L192 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24 [2019-12-07 18:43:45,224 WARN L192 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-12-07 18:43:45,227 INFO L246 CegarLoopResult]: For program point L597(lines 597 602) no Hoare annotation was computed. [2019-12-07 18:43:45,227 INFO L246 CegarLoopResult]: For program point L597-2(lines 596 610) no Hoare annotation was computed. [2019-12-07 18:43:45,228 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 18:43:45,228 INFO L242 CegarLoopResult]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse1) (and .cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2))) [2019-12-07 18:43:45,228 INFO L242 CegarLoopResult]: At program point L102(lines 101 594) the Hoare annotation is: false [2019-12-07 18:43:45,228 INFO L246 CegarLoopResult]: For program point L499(lines 499 502) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L599(lines 599 601) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L434-1(lines 434 442) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L335(lines 335 372) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L335-1(lines 335 372) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L203(lines 203 560) no Hoare annotation was computed. [2019-12-07 18:43:45,229 INFO L246 CegarLoopResult]: For program point L170(lines 170 571) no Hoare annotation was computed. [2019-12-07 18:43:45,230 INFO L246 CegarLoopResult]: For program point L137(lines 137 582) no Hoare annotation was computed. [2019-12-07 18:43:45,230 INFO L246 CegarLoopResult]: For program point L104(lines 104 593) no Hoare annotation was computed. [2019-12-07 18:43:45,230 INFO L242 CegarLoopResult]: At program point L402(lines 393 414) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-12-07 18:43:45,230 INFO L246 CegarLoopResult]: For program point L336(lines 336 369) no Hoare annotation was computed. [2019-12-07 18:43:45,230 INFO L246 CegarLoopResult]: For program point L303(lines 303 313) no Hoare annotation was computed. [2019-12-07 18:43:45,231 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 313) no Hoare annotation was computed. [2019-12-07 18:43:45,231 INFO L242 CegarLoopResult]: At program point L204(lines 203 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-12-07 18:43:45,231 INFO L242 CegarLoopResult]: At program point L171(lines 167 572) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse7 .cse8 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 .cse4 .cse6 .cse9))) [2019-12-07 18:43:45,231 INFO L242 CegarLoopResult]: At program point L138(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-12-07 18:43:45,232 INFO L246 CegarLoopResult]: For program point L535(lines 535 539) no Hoare annotation was computed. [2019-12-07 18:43:45,232 INFO L246 CegarLoopResult]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2019-12-07 18:43:45,232 INFO L246 CegarLoopResult]: For program point L437(lines 437 440) no Hoare annotation was computed. [2019-12-07 18:43:45,232 INFO L242 CegarLoopResult]: At program point L206(lines 205 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) [2019-12-07 18:43:45,232 INFO L246 CegarLoopResult]: For program point L173(lines 173 570) no Hoare annotation was computed. [2019-12-07 18:43:45,232 INFO L246 CegarLoopResult]: For program point L140(lines 140 581) no Hoare annotation was computed. [2019-12-07 18:43:45,233 INFO L246 CegarLoopResult]: For program point L107(lines 107 592) no Hoare annotation was computed. [2019-12-07 18:43:45,233 INFO L249 CegarLoopResult]: At program point L636(lines 627 638) the Hoare annotation is: true [2019-12-07 18:43:45,233 INFO L246 CegarLoopResult]: For program point L504(lines 504 514) no Hoare annotation was computed. [2019-12-07 18:43:45,233 INFO L246 CegarLoopResult]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-12-07 18:43:45,233 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-12-07 18:43:45,233 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L604(lines 604 608) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L307-2(lines 305 313) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L341(lines 341 367) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L176(lines 176 569) no Hoare annotation was computed. [2019-12-07 18:43:45,234 INFO L246 CegarLoopResult]: For program point L143(lines 143 580) no Hoare annotation was computed. [2019-12-07 18:43:45,235 INFO L246 CegarLoopResult]: For program point L110(lines 110 591) no Hoare annotation was computed. [2019-12-07 18:43:45,235 INFO L246 CegarLoopResult]: For program point L507(lines 507 513) no Hoare annotation was computed. [2019-12-07 18:43:45,235 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-12-07 18:43:45,235 INFO L246 CegarLoopResult]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-12-07 18:43:45,235 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 18:43:45,236 INFO L242 CegarLoopResult]: At program point L210(lines 104 593) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2))) [2019-12-07 18:43:45,236 INFO L242 CegarLoopResult]: At program point L177(lines 173 570) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse19 .cse18 .cse20 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse14 .cse16 .cse21))) [2019-12-07 18:43:45,236 INFO L242 CegarLoopResult]: At program point L144(lines 140 581) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L344-2(lines 344 348) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L179(lines 179 568) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L146(lines 146 579) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L113(lines 113 590) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-12-07 18:43:45,237 INFO L246 CegarLoopResult]: For program point L510-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L545(lines 545 551) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L545-1(lines 545 551) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L182(lines 182 567) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L149(lines 149 578) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L116(lines 116 589) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L246 CegarLoopResult]: For program point L381(lines 381 416) no Hoare annotation was computed. [2019-12-07 18:43:45,238 INFO L242 CegarLoopResult]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8))) [2019-12-07 18:43:45,239 INFO L242 CegarLoopResult]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L448(lines 448 450) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L382(lines 382 388) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L249 CegarLoopResult]: At program point L614(lines 97 615) the Hoare annotation is: true [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:43:45,239 INFO L246 CegarLoopResult]: For program point L185(lines 185 566) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L152(lines 152 577) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L119(lines 119 588) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L483(lines 483 485) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L242 CegarLoopResult]: At program point L120(lines 116 589) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-12-07 18:43:45,240 INFO L242 CegarLoopResult]: At program point L484(lines 71 625) the Hoare annotation is: false [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L451(lines 451 460) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L352(lines 352 363) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-12-07 18:43:45,240 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 18:43:45,241 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,241 INFO L242 CegarLoopResult]: At program point L353(lines 329 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-12-07 18:43:45,241 INFO L246 CegarLoopResult]: For program point L188(lines 188 565) no Hoare annotation was computed. [2019-12-07 18:43:45,241 INFO L246 CegarLoopResult]: For program point L155(lines 155 576) no Hoare annotation was computed. [2019-12-07 18:43:45,241 INFO L246 CegarLoopResult]: For program point L122(lines 122 587) no Hoare annotation was computed. [2019-12-07 18:43:45,242 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 18:43:45,242 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 625) no Hoare annotation was computed. [2019-12-07 18:43:45,242 INFO L246 CegarLoopResult]: For program point L486(lines 486 488) no Hoare annotation was computed. [2019-12-07 18:43:45,242 INFO L242 CegarLoopResult]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse1 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse4) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 .cse0 .cse1))) [2019-12-07 18:43:45,242 INFO L242 CegarLoopResult]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-12-07 18:43:45,243 INFO L242 CegarLoopResult]: At program point L123(lines 122 587) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 18:43:45,243 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 18:43:45,243 INFO L246 CegarLoopResult]: For program point L619(lines 619 621) no Hoare annotation was computed. [2019-12-07 18:43:45,243 INFO L246 CegarLoopResult]: For program point L619-2(lines 619 621) no Hoare annotation was computed. [2019-12-07 18:43:45,243 INFO L246 CegarLoopResult]: For program point L520(lines 520 523) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L355-2(lines 352 361) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L323-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,244 INFO L246 CegarLoopResult]: For program point L191(lines 191 564) no Hoare annotation was computed. [2019-12-07 18:43:45,245 INFO L246 CegarLoopResult]: For program point L158(lines 158 575) no Hoare annotation was computed. [2019-12-07 18:43:45,245 INFO L246 CegarLoopResult]: For program point L125(lines 125 586) no Hoare annotation was computed. [2019-12-07 18:43:45,245 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-12-07 18:43:45,245 INFO L246 CegarLoopResult]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-12-07 18:43:45,245 INFO L242 CegarLoopResult]: At program point L390(lines 381 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4))) [2019-12-07 18:43:45,245 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 18:43:45,246 INFO L246 CegarLoopResult]: For program point L194(lines 194 563) no Hoare annotation was computed. [2019-12-07 18:43:45,247 INFO L246 CegarLoopResult]: For program point L161(lines 161 574) no Hoare annotation was computed. [2019-12-07 18:43:45,247 INFO L246 CegarLoopResult]: For program point L128(lines 128 585) no Hoare annotation was computed. [2019-12-07 18:43:45,247 INFO L249 CegarLoopResult]: At program point L624(lines 10 626) the Hoare annotation is: true [2019-12-07 18:43:45,247 INFO L242 CegarLoopResult]: At program point L558(lines 98 613) the Hoare annotation is: (let ((.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse17 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse20 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0) (and .cse1 .cse16 .cse17 .cse7) (and .cse1 .cse16 .cse18) (and .cse8 .cse19 .cse17 .cse10 .cse12 .cse13 .cse14 .cse15 .cse7) (and .cse20 .cse21 .cse18 .cse6 .cse22) (and .cse20 .cse18 .cse6 .cse12 .cse4) (and .cse19 .cse17 .cse23 .cse21 .cse15 .cse7 .cse8 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse5 .cse19 .cse17 .cse7) (and .cse0 .cse8 .cse24 .cse25 .cse26 .cse27 .cse21 .cse23 .cse28 .cse29 .cse15 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse21 .cse22 .cse7) (and .cse1 .cse19 .cse2 .cse3 .cse17 .cse4 .cse7) (and .cse1 .cse16 .cse6 .cse7) (and .cse0 .cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse11 .cse15 .cse8 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse19 .cse17 .cse28 .cse7) (and .cse1 .cse2 .cse3 .cse18 .cse6 .cse4 .cse7) (and .cse0 .cse30 .cse28 .cse7) (and .cse5 .cse20 .cse18 .cse6))) [2019-12-07 18:43:45,247 INFO L246 CegarLoopResult]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-12-07 18:43:45,248 INFO L246 CegarLoopResult]: For program point L393(lines 393 414) no Hoare annotation was computed. [2019-12-07 18:43:45,248 INFO L242 CegarLoopResult]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3 .cse4 .cse5))) [2019-12-07 18:43:45,248 INFO L242 CegarLoopResult]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-12-07 18:43:45,248 INFO L246 CegarLoopResult]: For program point L394(lines 394 400) no Hoare annotation was computed. [2019-12-07 18:43:45,248 INFO L246 CegarLoopResult]: For program point L197(lines 197 562) no Hoare annotation was computed. [2019-12-07 18:43:45,249 INFO L246 CegarLoopResult]: For program point L164(lines 164 573) no Hoare annotation was computed. [2019-12-07 18:43:45,249 INFO L246 CegarLoopResult]: For program point L131(lines 131 584) no Hoare annotation was computed. [2019-12-07 18:43:45,249 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 613) the Hoare annotation is: (let ((.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse21 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse29 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse17 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse20 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0) (and .cse1 .cse16 .cse17 .cse7) (and .cse1 .cse16 .cse18) (and .cse8 .cse19 .cse17 .cse10 .cse12 .cse13 .cse14 .cse15 .cse7) (and .cse20 .cse21 .cse18 .cse6 .cse22) (and .cse20 .cse18 .cse6 .cse12 .cse4) (and .cse19 .cse17 .cse23 .cse21 .cse15 .cse7 .cse8 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse5 .cse19 .cse17 .cse7) (and .cse0 .cse8 .cse24 .cse25 .cse26 .cse27 .cse21 .cse23 .cse28 .cse29 .cse15 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse21 .cse22 .cse7) (and .cse1 .cse19 .cse2 .cse3 .cse17 .cse4 .cse7) (and .cse1 .cse16 .cse6 .cse7) (and .cse0 .cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse11 .cse15 .cse8 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse19 .cse17 .cse28 .cse7) (and .cse1 .cse2 .cse3 .cse18 .cse6 .cse4 .cse7) (and .cse0 .cse30 .cse28 .cse7) (and .cse5 .cse20 .cse18 .cse6))) [2019-12-07 18:43:45,249 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2019-12-07 18:43:45,250 INFO L246 CegarLoopResult]: For program point L528(lines 528 530) no Hoare annotation was computed. [2019-12-07 18:43:45,250 INFO L246 CegarLoopResult]: For program point L528-2(lines 207 557) no Hoare annotation was computed. [2019-12-07 18:43:45,250 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 18:43:45,250 INFO L242 CegarLoopResult]: At program point L165(lines 164 573) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2))) [2019-12-07 18:43:45,250 INFO L242 CegarLoopResult]: At program point L132(lines 125 586) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L595(lines 595 611) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L596(lines 596 610) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L332(lines 332 373) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L200(lines 200 561) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L167(lines 167 572) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L134(lines 134 583) no Hoare annotation was computed. [2019-12-07 18:43:45,251 INFO L246 CegarLoopResult]: For program point L101(lines 101 594) no Hoare annotation was computed. [2019-12-07 18:43:45,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:43:45 BoogieIcfgContainer [2019-12-07 18:43:45,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:43:45,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:43:45,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:43:45,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:43:45,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:43:13" (3/4) ... [2019-12-07 18:43:45,290 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:43:45,303 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:43:45,304 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:43:45,370 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3cb361a-271e-43bf-a6e3-878d6545ae39/bin/uautomizer/witness.graphml [2019-12-07 18:43:45,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:43:45,371 INFO L168 Benchmark]: Toolchain (without parser) took 32491.42 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 943.6 MB in the beginning and 1.6 GB in the end (delta: -631.9 MB). Peak memory consumption was 728.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,371 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:43:45,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -135.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:43:45,371 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,372 INFO L168 Benchmark]: RCFGBuilder took 413.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,372 INFO L168 Benchmark]: TraceAbstraction took 31651.66 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -567.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,372 INFO L168 Benchmark]: Witness Printer took 82.60 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:43:45,373 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -135.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 413.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31651.66 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -567.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 82.60 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 623]: 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: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && 8544 <= s__state) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8640)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8641)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8496)) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit) || ((((!(s__state == 8448) && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8448) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 4) && !(s__state == 12292)) || (((8672 <= s__state && 6 <= blastFlag) && !(s__state == 12292)) && 0 == s__hit)) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8641)) && 8640 <= s__state) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545))) || (s__state <= 3 && blastFlag <= 2)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((s__state <= 8672 && 8672 <= s__state) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 3 && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8657)) && !(s__state == 8641)) && 6 <= blastFlag) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8641)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8592)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) || (((((((((((((!(s__state == 8608) && !(s__state == 8592)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8544) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) || (((((blastFlag <= 2 && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8576) && !(s__state == 8545)) && 0 == s__hit) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && blastFlag <= 2) && !(s__state == 8641)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8640)) || (((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8641)) && 6 <= blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8640)) && 0 == s__hit)) || (((((((s__state <= 8672 && !(s__state == 8641)) && !(s__state == 8672)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__state == 8640)) && 0 == s__hit) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8544) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8641)) && 8640 <= s__state) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545))) || (s__state <= 3 && blastFlag <= 2)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((s__state <= 8672 && 8672 <= s__state) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 3 && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((((s__state <= 8672 && blastFlag <= 7) && !(s__state == 8657)) && !(s__state == 8641)) && 6 <= blastFlag) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8641)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && 0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) || ((((blastFlag <= 4 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) && 0 == s__hit)) || ((((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 8640) && 8640 <= s__state) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8561) && !(s__state == 8544)) && !(s__state == 8592)) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8640) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) && 0 == s__hit) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8592)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8560)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8545)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8561)) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) || ((((((!(s__state == 8561) && blastFlag <= 7) && 6 <= blastFlag) && 8544 <= s__state) && !(s__state == 8560)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 43, TraceHistogramMax: 14, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.5s, HoareTripleCheckerStatistics: 7875 SDtfs, 6018 SDslu, 3426 SDs, 0 SdLazy, 4127 SolverSat, 1427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1852 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6339occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 43 MinimizatonAttempts, 10655 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 263 NumberOfFragments, 2635 HoareAnnotationTreeSize, 28 FomulaSimplifications, 400389 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 109652 FormulaSimplificationTreeSizeReductionInter, 17.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 8758 NumberOfCodeBlocks, 8758 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 8709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026590 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3004 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 49 InterpolantComputations, 39 PerfectInterpolantSequences, 21964/22196 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...