./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:55:31,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:55:31,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:55:31,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:55:31,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:55:31,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:55:31,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:55:31,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:55:31,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:55:31,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:55:31,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:55:31,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:55:31,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:55:31,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:55:31,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:55:31,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:55:31,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:55:31,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:55:31,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:55:31,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:55:31,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:55:31,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:55:31,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:55:31,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:55:31,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:55:31,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:55:31,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:55:31,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:55:31,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:55:31,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:55:31,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:55:31,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:55:31,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:55:31,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:55:31,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:55:31,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:55:31,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:55:31,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:55:31,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:55:31,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:55:31,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:55:31,843 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:55:31,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:55:31,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:55:31,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:55:31,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:55:31,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:55:31,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:55:31,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:55:31,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:55:31,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:55:31,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:55:31,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:55:31,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:55:31,856 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:55:31,856 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_1de5e944-cb7c-44f5-879a-261fe73a7875/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-12-07 10:55:31,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:55:31,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:55:31,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:55:31,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:55:31,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:55:31,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-12-07 10:55:32,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/data/1f63722e2/33fe58593df0449ea261193c7eac3c66/FLAGf166cef4d [2019-12-07 10:55:32,438 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:55:32,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-12-07 10:55:32,447 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/data/1f63722e2/33fe58593df0449ea261193c7eac3c66/FLAGf166cef4d [2019-12-07 10:55:32,456 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/data/1f63722e2/33fe58593df0449ea261193c7eac3c66 [2019-12-07 10:55:32,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:55:32,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:55:32,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:55:32,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:55:32,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:55:32,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,464 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 10:55:32, skipping insertion in model container [2019-12-07 10:55:32,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:55:32,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:55:32,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:55:32,663 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:55:32,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:55:32,709 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:55:32,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32 WrapperNode [2019-12-07 10:55:32,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:55:32,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:55:32,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:55:32,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:55:32,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:55:32,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:55:32,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:55:32,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:55:32,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... [2019-12-07 10:55:32,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:55:32,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:55:32,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:55:32,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:55:32,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:55:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:55:32,899 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:55:33,222 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 10:55:33,222 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 10:55:33,223 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:55:33,223 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:55:33,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:33 BoogieIcfgContainer [2019-12-07 10:55:33,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:55:33,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:55:33,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:55:33,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:55:33,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:55:32" (1/3) ... [2019-12-07 10:55:33,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37395eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:55:33, skipping insertion in model container [2019-12-07 10:55:33,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:32" (2/3) ... [2019-12-07 10:55:33,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37395eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:55:33, skipping insertion in model container [2019-12-07 10:55:33,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:33" (3/3) ... [2019-12-07 10:55:33,229 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-12-07 10:55:33,236 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:55:33,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:55:33,249 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:55:33,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:55:33,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:55:33,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:55:33,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:55:33,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:55:33,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:55:33,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:55:33,268 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:55:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-12-07 10:55:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:55:33,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:33,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:33,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-12-07 10:55:33,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:33,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386076103] [2019-12-07 10:55:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:33,455 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 10:55:33,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386076103] [2019-12-07 10:55:33,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224774859] [2019-12-07 10:55:33,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:33,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:33,471 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-12-07 10:55:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:33,633 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-12-07 10:55:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:33,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 10:55:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:33,643 INFO L225 Difference]: With dead ends: 322 [2019-12-07 10:55:33,643 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 10:55:33,646 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 10:55:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 10:55:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-12-07 10:55:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 10:55:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-12-07 10:55:33,682 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-12-07 10:55:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:33,682 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-12-07 10:55:33,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-12-07 10:55:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:55:33,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:33,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:33,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-12-07 10:55:33,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:33,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843999843] [2019-12-07 10:55:33,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:33,729 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 10:55:33,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843999843] [2019-12-07 10:55:33,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:33,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:33,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015151349] [2019-12-07 10:55:33,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:33,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:33,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:33,732 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-12-07 10:55:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:33,863 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-12-07 10:55:33,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:33,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 10:55:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:33,865 INFO L225 Difference]: With dead ends: 371 [2019-12-07 10:55:33,866 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 10:55:33,867 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 10:55:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 10:55:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-12-07 10:55:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 10:55:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-07 10:55:33,879 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-12-07 10:55:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:33,879 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-07 10:55:33,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-07 10:55:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 10:55:33,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:33,882 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:33,882 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-12-07 10:55:33,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062129675] [2019-12-07 10:55:33,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:33,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062129675] [2019-12-07 10:55:33,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:33,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:33,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985713800] [2019-12-07 10:55:33,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:33,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:33,925 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-12-07 10:55:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,035 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-12-07 10:55:34,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 10:55:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,037 INFO L225 Difference]: With dead ends: 436 [2019-12-07 10:55:34,037 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 10:55:34,038 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 10:55:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 10:55:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-12-07 10:55:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 10:55:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-12-07 10:55:34,049 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-12-07 10:55:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,049 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-12-07 10:55:34,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-12-07 10:55:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 10:55:34,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,051 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-12-07 10:55:34,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291222608] [2019-12-07 10:55:34,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:34,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291222608] [2019-12-07 10:55:34,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107820419] [2019-12-07 10:55:34,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,087 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-12-07 10:55:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,168 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-12-07 10:55:34,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 10:55:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,170 INFO L225 Difference]: With dead ends: 484 [2019-12-07 10:55:34,170 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 10:55:34,171 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 10:55:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 10:55:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-12-07 10:55:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 10:55:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-12-07 10:55:34,186 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-12-07 10:55:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,186 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-12-07 10:55:34,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-12-07 10:55:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 10:55:34,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,187 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,187 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-12-07 10:55:34,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114202928] [2019-12-07 10:55:34,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:34,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114202928] [2019-12-07 10:55:34,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104532753] [2019-12-07 10:55:34,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,235 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-12-07 10:55:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,327 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-12-07 10:55:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 10:55:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,329 INFO L225 Difference]: With dead ends: 543 [2019-12-07 10:55:34,330 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 10:55:34,330 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 10:55:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 10:55:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-12-07 10:55:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 10:55:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-12-07 10:55:34,338 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-12-07 10:55:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,338 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-12-07 10:55:34,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-12-07 10:55:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 10:55:34,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,339 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,340 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-12-07 10:55:34,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414343597] [2019-12-07 10:55:34,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:34,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414343597] [2019-12-07 10:55:34,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757415757] [2019-12-07 10:55:34,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,365 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-12-07 10:55:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,436 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-12-07 10:55:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 10:55:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,437 INFO L225 Difference]: With dead ends: 583 [2019-12-07 10:55:34,438 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 10:55:34,438 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 10:55:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 10:55:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-12-07 10:55:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 10:55:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-12-07 10:55:34,445 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-12-07 10:55:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,445 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-12-07 10:55:34,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-12-07 10:55:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 10:55:34,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,446 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-12-07 10:55:34,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014608265] [2019-12-07 10:55:34,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:34,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014608265] [2019-12-07 10:55:34,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212625672] [2019-12-07 10:55:34,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,475 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-12-07 10:55:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,586 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-12-07 10:55:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 10:55:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,587 INFO L225 Difference]: With dead ends: 585 [2019-12-07 10:55:34,588 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 10:55:34,588 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 10:55:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 10:55:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-12-07 10:55:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 10:55:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-12-07 10:55:34,595 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-12-07 10:55:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-12-07 10:55:34,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-12-07 10:55:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 10:55:34,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,596 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,597 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-12-07 10:55:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835515610] [2019-12-07 10:55:34,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:55:34,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835515610] [2019-12-07 10:55:34,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142406841] [2019-12-07 10:55:34,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,622 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-12-07 10:55:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,693 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-12-07 10:55:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 10:55:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,696 INFO L225 Difference]: With dead ends: 585 [2019-12-07 10:55:34,696 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 10:55:34,697 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 10:55:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 10:55:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-12-07 10:55:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-07 10:55:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-12-07 10:55:34,707 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-12-07 10:55:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,707 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-12-07 10:55:34,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-12-07 10:55:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 10:55:34,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,709 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,709 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-12-07 10:55:34,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679898471] [2019-12-07 10:55:34,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:34,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679898471] [2019-12-07 10:55:34,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316530500] [2019-12-07 10:55:34,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,744 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-12-07 10:55:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,837 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-12-07 10:55:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 10:55:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,839 INFO L225 Difference]: With dead ends: 624 [2019-12-07 10:55:34,839 INFO L226 Difference]: Without dead ends: 331 [2019-12-07 10:55:34,840 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 10:55:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-07 10:55:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-12-07 10:55:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-07 10:55:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-12-07 10:55:34,851 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-12-07 10:55:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,851 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-12-07 10:55:34,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-12-07 10:55:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 10:55:34,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:34,852 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:34,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-12-07 10:55:34,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:34,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293373505] [2019-12-07 10:55:34,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:34,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293373505] [2019-12-07 10:55:34,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:34,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277196422] [2019-12-07 10:55:34,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:34,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:34,884 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-12-07 10:55:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:34,987 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-12-07 10:55:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:34,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 10:55:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:34,989 INFO L225 Difference]: With dead ends: 685 [2019-12-07 10:55:34,989 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 10:55:34,990 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 10:55:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 10:55:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-12-07 10:55:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 10:55:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-12-07 10:55:34,998 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-12-07 10:55:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:34,998 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-12-07 10:55:34,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-12-07 10:55:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 10:55:35,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,000 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,000 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-12-07 10:55:35,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345249405] [2019-12-07 10:55:35,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:35,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345249405] [2019-12-07 10:55:35,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:35,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118785768] [2019-12-07 10:55:35,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,026 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-12-07 10:55:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,124 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-12-07 10:55:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 10:55:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,127 INFO L225 Difference]: With dead ends: 707 [2019-12-07 10:55:35,127 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 10:55:35,127 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 10:55:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 10:55:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-12-07 10:55:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 10:55:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-12-07 10:55:35,135 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-12-07 10:55:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,136 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-12-07 10:55:35,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-12-07 10:55:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 10:55:35,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,137 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-12-07 10:55:35,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104095917] [2019-12-07 10:55:35,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:55:35,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104095917] [2019-12-07 10:55:35,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:35,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194435097] [2019-12-07 10:55:35,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,162 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-12-07 10:55:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,269 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-12-07 10:55:35,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 10:55:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,271 INFO L225 Difference]: With dead ends: 712 [2019-12-07 10:55:35,271 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 10:55:35,271 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 10:55:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 10:55:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-12-07 10:55:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 10:55:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-12-07 10:55:35,279 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-12-07 10:55:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,280 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-12-07 10:55:35,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-12-07 10:55:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 10:55:35,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,281 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-12-07 10:55:35,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644932991] [2019-12-07 10:55:35,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 10:55:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644932991] [2019-12-07 10:55:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184325004] [2019-12-07 10:55:35,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,301 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-12-07 10:55:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,387 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-12-07 10:55:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 10:55:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,389 INFO L225 Difference]: With dead ends: 730 [2019-12-07 10:55:35,390 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 10:55:35,390 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 10:55:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 10:55:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-12-07 10:55:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 10:55:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-12-07 10:55:35,403 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-12-07 10:55:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,403 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-12-07 10:55:35,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-12-07 10:55:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 10:55:35,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-12-07 10:55:35,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946646694] [2019-12-07 10:55:35,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 10:55:35,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946646694] [2019-12-07 10:55:35,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:35,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310442193] [2019-12-07 10:55:35,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,427 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-12-07 10:55:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,519 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-12-07 10:55:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 10:55:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,521 INFO L225 Difference]: With dead ends: 751 [2019-12-07 10:55:35,522 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 10:55:35,522 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 10:55:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 10:55:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-12-07 10:55:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 10:55:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-12-07 10:55:35,536 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-12-07 10:55:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,536 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-12-07 10:55:35,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-12-07 10:55:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 10:55:35,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,538 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-12-07 10:55:35,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28261667] [2019-12-07 10:55:35,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 10:55:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28261667] [2019-12-07 10:55:35,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440985500] [2019-12-07 10:55:35,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,580 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-12-07 10:55:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,612 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-12-07 10:55:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 10:55:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,616 INFO L225 Difference]: With dead ends: 747 [2019-12-07 10:55:35,616 INFO L226 Difference]: Without dead ends: 745 [2019-12-07 10:55:35,616 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 10:55:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-12-07 10:55:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-12-07 10:55:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-07 10:55:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-12-07 10:55:35,634 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-12-07 10:55:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,634 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-12-07 10:55:35,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-12-07 10:55:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 10:55:35,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,636 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:35,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-12-07 10:55:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:35,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469618634] [2019-12-07 10:55:35,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:35,642 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:35,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311162283] [2019-12-07 10:55:35,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:35,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:55:35,707 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 10:55:35,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469618634] [2019-12-07 10:55:35,740 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:35,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311162283] [2019-12-07 10:55:35,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:35,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:35,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634102445] [2019-12-07 10:55:35,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:35,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,742 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-12-07 10:55:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:35,798 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-12-07 10:55:35,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:35,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 10:55:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:35,803 INFO L225 Difference]: With dead ends: 1851 [2019-12-07 10:55:35,803 INFO L226 Difference]: Without dead ends: 1113 [2019-12-07 10:55:35,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-07 10:55:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-12-07 10:55:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-07 10:55:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-12-07 10:55:35,830 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-12-07 10:55:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:35,831 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-12-07 10:55:35,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-12-07 10:55:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 10:55:35,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:35,833 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:36,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:36,033 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-12-07 10:55:36,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:36,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714520213] [2019-12-07 10:55:36,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:36,040 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:36,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494813551] [2019-12-07 10:55:36,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:36,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:55:36,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 10:55:36,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714520213] [2019-12-07 10:55:36,121 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:36,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494813551] [2019-12-07 10:55:36,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:36,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:36,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736055310] [2019-12-07 10:55:36,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:36,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:36,122 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-12-07 10:55:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:36,169 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-12-07 10:55:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:36,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-12-07 10:55:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:36,175 INFO L225 Difference]: With dead ends: 2219 [2019-12-07 10:55:36,175 INFO L226 Difference]: Without dead ends: 1481 [2019-12-07 10:55:36,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-12-07 10:55:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-12-07 10:55:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-07 10:55:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-12-07 10:55:36,209 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-12-07 10:55:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:36,210 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-12-07 10:55:36,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-12-07 10:55:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 10:55:36,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:36,212 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:36,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:36,413 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-12-07 10:55:36,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:36,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172245816] [2019-12-07 10:55:36,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 10:55:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172245816] [2019-12-07 10:55:36,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:36,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298139730] [2019-12-07 10:55:36,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:36,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:36,452 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-12-07 10:55:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:36,581 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-12-07 10:55:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:36,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 10:55:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:36,590 INFO L225 Difference]: With dead ends: 3059 [2019-12-07 10:55:36,590 INFO L226 Difference]: Without dead ends: 1585 [2019-12-07 10:55:36,592 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 10:55:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-12-07 10:55:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-12-07 10:55:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-12-07 10:55:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-12-07 10:55:36,640 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-12-07 10:55:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:36,640 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-12-07 10:55:36,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-12-07 10:55:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 10:55:36,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:36,643 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:36,643 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-12-07 10:55:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:36,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194144634] [2019-12-07 10:55:36,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:36,650 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:36,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788874437] [2019-12-07 10:55:36,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:36,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:55:36,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:55:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194144634] [2019-12-07 10:55:36,730 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788874437] [2019-12-07 10:55:36,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:36,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:36,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564379163] [2019-12-07 10:55:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:36,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:36,731 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-12-07 10:55:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:36,791 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-12-07 10:55:36,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:36,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 10:55:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:36,799 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 10:55:36,799 INFO L226 Difference]: Without dead ends: 1964 [2019-12-07 10:55:36,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-07 10:55:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-12-07 10:55:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-12-07 10:55:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-12-07 10:55:36,846 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-12-07 10:55:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:36,847 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-12-07 10:55:36,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-12-07 10:55:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 10:55:36,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:36,850 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:37,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:37,051 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-12-07 10:55:37,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:37,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029938237] [2019-12-07 10:55:37,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:37,059 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007537939] [2019-12-07 10:55:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:37,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:55:37,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 10:55:37,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029938237] [2019-12-07 10:55:37,171 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:37,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007537939] [2019-12-07 10:55:37,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:37,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:37,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351586534] [2019-12-07 10:55:37,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:37,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:37,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:37,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:37,173 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-12-07 10:55:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:37,251 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-12-07 10:55:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:37,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-12-07 10:55:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:37,265 INFO L225 Difference]: With dead ends: 5743 [2019-12-07 10:55:37,265 INFO L226 Difference]: Without dead ends: 3786 [2019-12-07 10:55:37,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-12-07 10:55:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-12-07 10:55:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 10:55:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-12-07 10:55:37,346 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-12-07 10:55:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:37,346 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-12-07 10:55:37,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-12-07 10:55:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-12-07 10:55:37,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:37,353 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:37,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:37,553 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-12-07 10:55:37,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:37,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381828972] [2019-12-07 10:55:37,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:37,563 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:37,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697524156] [2019-12-07 10:55:37,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:37,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:55:37,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-07 10:55:37,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381828972] [2019-12-07 10:55:37,659 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:37,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697524156] [2019-12-07 10:55:37,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:37,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:37,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681169460] [2019-12-07 10:55:37,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:37,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:37,660 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-12-07 10:55:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:37,831 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-12-07 10:55:37,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:37,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-12-07 10:55:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:37,847 INFO L225 Difference]: With dead ends: 7651 [2019-12-07 10:55:37,848 INFO L226 Difference]: Without dead ends: 3874 [2019-12-07 10:55:37,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-12-07 10:55:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-12-07 10:55:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 10:55:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-12-07 10:55:37,943 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-12-07 10:55:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:37,943 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-12-07 10:55:37,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-12-07 10:55:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-12-07 10:55:37,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:37,951 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:38,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:38,153 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-12-07 10:55:38,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:38,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835022377] [2019-12-07 10:55:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 10:55:38,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835022377] [2019-12-07 10:55:38,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:38,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:38,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606983236] [2019-12-07 10:55:38,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:38,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:38,324 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-12-07 10:55:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:38,471 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-12-07 10:55:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:38,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-12-07 10:55:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:38,490 INFO L225 Difference]: With dead ends: 7683 [2019-12-07 10:55:38,490 INFO L226 Difference]: Without dead ends: 3906 [2019-12-07 10:55:38,495 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 10:55:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-12-07 10:55:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-12-07 10:55:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 10:55:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-12-07 10:55:38,573 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-12-07 10:55:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:38,573 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-12-07 10:55:38,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-12-07 10:55:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-12-07 10:55:38,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:38,579 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:38,579 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-12-07 10:55:38,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:38,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357687858] [2019-12-07 10:55:38,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:38,587 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:38,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817285125] [2019-12-07 10:55:38,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/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 10:55:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:38,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:55:38,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-12-07 10:55:38,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357687858] [2019-12-07 10:55:38,689 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817285125] [2019-12-07 10:55:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:38,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:38,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984321393] [2019-12-07 10:55:38,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:38,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:38,690 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-12-07 10:55:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:38,822 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-12-07 10:55:38,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:38,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-12-07 10:55:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:38,837 INFO L225 Difference]: With dead ends: 7561 [2019-12-07 10:55:38,837 INFO L226 Difference]: Without dead ends: 3784 [2019-12-07 10:55:38,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-12-07 10:55:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-12-07 10:55:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-07 10:55:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-12-07 10:55:38,911 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-12-07 10:55:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:38,911 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-12-07 10:55:38,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-12-07 10:55:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 10:55:38,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:38,916 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:39,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:39,117 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-12-07 10:55:39,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:39,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811762366] [2019-12-07 10:55:39,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:39,126 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 10:55:39,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123305025] [2019-12-07 10:55:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:39,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:55:39,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-12-07 10:55:39,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811762366] [2019-12-07 10:55:39,246 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:55:39,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123305025] [2019-12-07 10:55:39,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:39,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:39,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575231778] [2019-12-07 10:55:39,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:39,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:39,247 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-12-07 10:55:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:39,392 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-12-07 10:55:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:39,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-12-07 10:55:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:39,396 INFO L225 Difference]: With dead ends: 7951 [2019-12-07 10:55:39,396 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 10:55:39,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 10:55:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-12-07 10:55:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-12-07 10:55:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-12-07 10:55:39,431 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-12-07 10:55:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:39,431 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-12-07 10:55:39,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-12-07 10:55:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-12-07 10:55:39,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:39,434 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:39,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:39,635 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-12-07 10:55:39,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:39,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932335136] [2019-12-07 10:55:39,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-12-07 10:55:39,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932335136] [2019-12-07 10:55:39,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:39,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:39,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643162582] [2019-12-07 10:55:39,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:39,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:39,741 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-12-07 10:55:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:39,848 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-12-07 10:55:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:39,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-12-07 10:55:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:39,852 INFO L225 Difference]: With dead ends: 4829 [2019-12-07 10:55:39,852 INFO L226 Difference]: Without dead ends: 2529 [2019-12-07 10:55:39,854 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 10:55:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-12-07 10:55:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-12-07 10:55:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-12-07 10:55:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-12-07 10:55:39,897 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-12-07 10:55:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:39,898 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-12-07 10:55:39,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-12-07 10:55:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-12-07 10:55:39,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:39,902 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:39,902 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-12-07 10:55:39,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:39,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569833726] [2019-12-07 10:55:39,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-12-07 10:55:40,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569833726] [2019-12-07 10:55:40,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:40,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:40,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801304034] [2019-12-07 10:55:40,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:40,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:40,007 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-12-07 10:55:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:40,112 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-12-07 10:55:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:40,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-12-07 10:55:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:40,116 INFO L225 Difference]: With dead ends: 4949 [2019-12-07 10:55:40,116 INFO L226 Difference]: Without dead ends: 2499 [2019-12-07 10:55:40,118 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 10:55:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-12-07 10:55:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-12-07 10:55:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-12-07 10:55:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-12-07 10:55:40,149 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-12-07 10:55:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:40,150 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-12-07 10:55:40,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-12-07 10:55:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-12-07 10:55:40,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:40,153 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:40,153 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-12-07 10:55:40,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:40,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663538080] [2019-12-07 10:55:40,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 10:55:40,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663538080] [2019-12-07 10:55:40,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759257559] [2019-12-07 10:55:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:40,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:55:40,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 10:55:40,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:55:40,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 10:55:40,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140787723] [2019-12-07 10:55:40,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:40,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:40,411 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-12-07 10:55:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:40,613 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-12-07 10:55:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:55:40,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-12-07 10:55:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:40,617 INFO L225 Difference]: With dead ends: 6557 [2019-12-07 10:55:40,617 INFO L226 Difference]: Without dead ends: 3975 [2019-12-07 10:55:40,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-12-07 10:55:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-12-07 10:55:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-07 10:55:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-12-07 10:55:40,659 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-12-07 10:55:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:40,660 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-12-07 10:55:40,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-12-07 10:55:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-12-07 10:55:40,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:40,663 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:40,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:40,864 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:40,864 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-12-07 10:55:40,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:40,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644113732] [2019-12-07 10:55:40,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-12-07 10:55:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644113732] [2019-12-07 10:55:40,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:40,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:40,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536638199] [2019-12-07 10:55:40,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:40,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:40,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:40,975 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-12-07 10:55:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:41,071 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-12-07 10:55:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:41,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-12-07 10:55:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:41,077 INFO L225 Difference]: With dead ends: 5073 [2019-12-07 10:55:41,077 INFO L226 Difference]: Without dead ends: 2546 [2019-12-07 10:55:41,079 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 10:55:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-12-07 10:55:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-12-07 10:55:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-07 10:55:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-12-07 10:55:41,131 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-12-07 10:55:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:41,132 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-12-07 10:55:41,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-12-07 10:55:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-12-07 10:55:41,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:41,137 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:41,137 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-12-07 10:55:41,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:41,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933807492] [2019-12-07 10:55:41,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-12-07 10:55:41,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933807492] [2019-12-07 10:55:41,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:41,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:41,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220354316] [2019-12-07 10:55:41,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:41,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:41,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:41,314 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-12-07 10:55:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:41,414 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-12-07 10:55:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:41,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-12-07 10:55:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:41,418 INFO L225 Difference]: With dead ends: 5277 [2019-12-07 10:55:41,418 INFO L226 Difference]: Without dead ends: 2750 [2019-12-07 10:55:41,420 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 10:55:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-12-07 10:55:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-12-07 10:55:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-12-07 10:55:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-12-07 10:55:41,458 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-12-07 10:55:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-12-07 10:55:41,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-12-07 10:55:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-12-07 10:55:41,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:41,463 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:41,463 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-12-07 10:55:41,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:41,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977120066] [2019-12-07 10:55:41,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-12-07 10:55:41,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977120066] [2019-12-07 10:55:41,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:41,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:41,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142380415] [2019-12-07 10:55:41,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:41,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:41,611 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-12-07 10:55:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:41,744 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-12-07 10:55:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:41,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-12-07 10:55:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:41,747 INFO L225 Difference]: With dead ends: 5697 [2019-12-07 10:55:41,747 INFO L226 Difference]: Without dead ends: 2966 [2019-12-07 10:55:41,750 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 10:55:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-12-07 10:55:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-12-07 10:55:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-12-07 10:55:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-12-07 10:55:41,807 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-12-07 10:55:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:41,808 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-12-07 10:55:41,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-12-07 10:55:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-12-07 10:55:41,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:41,813 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:41,813 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-12-07 10:55:41,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:41,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464763656] [2019-12-07 10:55:41,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 10:55:42,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464763656] [2019-12-07 10:55:42,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219245604] [2019-12-07 10:55:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:42,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:55:42,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 10:55:42,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:55:42,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 10:55:42,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888446383] [2019-12-07 10:55:42,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:42,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:42,336 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-12-07 10:55:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:42,443 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-12-07 10:55:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:55:42,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-12-07 10:55:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:42,444 INFO L225 Difference]: With dead ends: 4704 [2019-12-07 10:55:42,444 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:55:42,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:55:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:55:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:55:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:55:42,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-12-07 10:55:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:42,447 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:55:42,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:55:42,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:55:42,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:42,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:55:43,272 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-12-07 10:55:43,521 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 10:55:43,636 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 10:55:43,741 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 10:55:43,945 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-07 10:55:44,071 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 10:55:44,175 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 10:55:44,286 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-07 10:55:44,504 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 10:55:44,665 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-07 10:55:44,889 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-07 10:55:44,991 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-07 10:55:45,167 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-12-07 10:55:45,348 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L242 CegarLoopResult]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-12-07 10:55:45,349 INFO L242 CegarLoopResult]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L246 CegarLoopResult]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-12-07 10:55:45,349 INFO L242 CegarLoopResult]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 10:55:45,350 INFO L242 CegarLoopResult]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,350 INFO L242 CegarLoopResult]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-12-07 10:55:45,350 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L242 CegarLoopResult]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L249 CegarLoopResult]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L249 CegarLoopResult]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-12-07 10:55:45,351 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L242 CegarLoopResult]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,352 INFO L242 CegarLoopResult]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L242 CegarLoopResult]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-12-07 10:55:45,352 INFO L246 CegarLoopResult]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L242 CegarLoopResult]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,353 INFO L242 CegarLoopResult]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-12-07 10:55:45,353 INFO L246 CegarLoopResult]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L242 CegarLoopResult]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L242 CegarLoopResult]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L249 CegarLoopResult]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:55:45,354 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L242 CegarLoopResult]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-12-07 10:55:45,355 INFO L242 CegarLoopResult]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 10:55:45,355 INFO L242 CegarLoopResult]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 10:55:45,355 INFO L242 CegarLoopResult]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-12-07 10:55:45,355 INFO L246 CegarLoopResult]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L249 CegarLoopResult]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L242 CegarLoopResult]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,356 INFO L242 CegarLoopResult]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-12-07 10:55:45,356 INFO L246 CegarLoopResult]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-12-07 10:55:45,357 INFO L246 CegarLoopResult]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-12-07 10:55:45,358 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,358 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-12-07 10:55:45,358 INFO L242 CegarLoopResult]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 10:55:45,358 INFO L242 CegarLoopResult]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-12-07 10:55:45,358 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 10:55:45,358 INFO L246 CegarLoopResult]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-12-07 10:55:45,358 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-12-07 10:55:45,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:55:45 BoogieIcfgContainer [2019-12-07 10:55:45,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:55:45,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:55:45,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:55:45,392 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:55:45,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:33" (3/4) ... [2019-12-07 10:55:45,396 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:55:45,411 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:55:45,412 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:55:45,482 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1de5e944-cb7c-44f5-879a-261fe73a7875/bin/uautomizer/witness.graphml [2019-12-07 10:55:45,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:55:45,483 INFO L168 Benchmark]: Toolchain (without parser) took 13024.84 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 842.0 MB). Free memory was 939.3 MB in the beginning and 1.7 GB in the end (delta: -723.9 MB). Peak memory consumption was 118.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:45,484 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:55:45,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:45,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.86 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 10:55:45,484 INFO L168 Benchmark]: Boogie Preprocessor took 25.15 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 10:55:45,484 INFO L168 Benchmark]: RCFGBuilder took 447.25 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:45,485 INFO L168 Benchmark]: TraceAbstraction took 12166.56 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 755.5 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -660.9 MB). Peak memory consumption was 793.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:45,485 INFO L168 Benchmark]: Witness Printer took 90.53 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:45,486 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.86 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 25.15 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 447.25 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12166.56 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 755.5 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -660.9 MB). Peak memory consumption was 793.9 MB. Max. memory is 11.5 GB. * Witness Printer took 90.53 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 9.3s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...