./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a51e7d7d3160b4418bb04f01bccc7314d2964c0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:31:12,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:31:12,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:31:12,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:31:12,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:31:12,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:31:12,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:31:12,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:31:12,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:31:12,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:31:12,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:31:12,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:31:12,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:31:12,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:31:12,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:31:12,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:31:12,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:31:12,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:31:12,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:31:12,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:31:12,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:31:12,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:31:12,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:31:12,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:31:12,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:31:12,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:31:12,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:31:12,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:31:12,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:31:12,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:31:12,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:31:12,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:31:12,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:31:12,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:31:12,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:31:12,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:31:12,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:31:12,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:31:12,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:31:12,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:31:12,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:31:12,261 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:31:12,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:31:12,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:31:12,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:31:12,307 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:31:12,307 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:31:12,307 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:31:12,307 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:31:12,308 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:31:12,314 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:31:12,315 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:31:12,316 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:31:12,316 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:31:12,316 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:31:12,316 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:31:12,317 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:31:12,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:31:12,318 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:31:12,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:31:12,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:31:12,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:31:12,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:31:12,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:31:12,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:31:12,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:31:12,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:31:12,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:31:12,320 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:31:12,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:31:12,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:31:12,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:31:12,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:31:12,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:31:12,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:31:12,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:31:12,324 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:31:12,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:31:12,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:31:12,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:31:12,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:31:12,325 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2a51e7d7d3160b4418bb04f01bccc7314d2964c0 [2021-10-11 02:31:12,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:31:12,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:31:12,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:31:12,627 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:31:12,628 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:31:12,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2021-10-11 02:31:12,701 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/data/3f6ca55bc/0247529525274e96baee6937bff7ec97/FLAGab79bcc9c [2021-10-11 02:31:13,212 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:31:13,213 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2021-10-11 02:31:13,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/data/3f6ca55bc/0247529525274e96baee6937bff7ec97/FLAGab79bcc9c [2021-10-11 02:31:13,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/data/3f6ca55bc/0247529525274e96baee6937bff7ec97 [2021-10-11 02:31:13,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:31:13,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:31:13,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:31:13,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:31:13,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:31:13,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b56999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13, skipping insertion in model container [2021-10-11 02:31:13,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:31:13,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:31:13,801 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2021-10-11 02:31:13,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:31:13,822 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:31:13,835 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2021-10-11 02:31:13,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:31:13,854 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:31:13,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13 WrapperNode [2021-10-11 02:31:13,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:31:13,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:31:13,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:31:13,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:31:13,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:31:13,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:31:13,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:31:13,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:31:13,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... [2021-10-11 02:31:13,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:31:13,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:31:13,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:31:13,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:31:13,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:31:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:31:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:31:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:31:14,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:31:14,321 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-10-11 02:31:14,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:14 BoogieIcfgContainer [2021-10-11 02:31:14,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:31:14,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:31:14,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:31:14,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:31:14,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:13" (1/3) ... [2021-10-11 02:31:14,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444efcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:14, skipping insertion in model container [2021-10-11 02:31:14,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:13" (2/3) ... [2021-10-11 02:31:14,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444efcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:14, skipping insertion in model container [2021-10-11 02:31:14,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:14" (3/3) ... [2021-10-11 02:31:14,331 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2021-10-11 02:31:14,344 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:31:14,347 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2021-10-11 02:31:14,373 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-10-11 02:31:14,398 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:31:14,399 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:31:14,399 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:31:14,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:31:14,399 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:31:14,400 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:31:14,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:31:14,400 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:31:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2021-10-11 02:31:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:31:14,420 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:14,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:14,421 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2130258081, now seen corresponding path program 1 times [2021-10-11 02:31:14,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:14,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743650344] [2021-10-11 02:31:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:14,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743650344] [2021-10-11 02:31:14,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:14,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:31:14,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426615259] [2021-10-11 02:31:14,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-10-11 02:31:14,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 02:31:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:31:14,607 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2021-10-11 02:31:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:14,626 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2021-10-11 02:31:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 02:31:14,627 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-10-11 02:31:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:14,635 INFO L225 Difference]: With dead ends: 78 [2021-10-11 02:31:14,636 INFO L226 Difference]: Without dead ends: 38 [2021-10-11 02:31:14,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:31:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-11 02:31:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-11 02:31:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-11 02:31:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-11 02:31:14,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 8 [2021-10-11 02:31:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:14,674 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-11 02:31:14,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-10-11 02:31:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-11 02:31:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:31:14,675 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:14,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:14,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:31:14,676 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1559179223, now seen corresponding path program 1 times [2021-10-11 02:31:14,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:14,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182784920] [2021-10-11 02:31:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:14,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182784920] [2021-10-11 02:31:14,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:14,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:31:14,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532913103] [2021-10-11 02:31:14,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:31:14,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:31:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:31:14,780 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2021-10-11 02:31:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:14,868 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-10-11 02:31:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:31:14,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-10-11 02:31:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:14,874 INFO L225 Difference]: With dead ends: 42 [2021-10-11 02:31:14,874 INFO L226 Difference]: Without dead ends: 36 [2021-10-11 02:31:14,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-10-11 02:31:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-10-11 02:31:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:31:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-11 02:31:14,881 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2021-10-11 02:31:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:14,882 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-11 02:31:14,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:31:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-11 02:31:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:31:14,883 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:14,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:14,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:31:14,883 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -572195110, now seen corresponding path program 1 times [2021-10-11 02:31:14,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:14,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427810483] [2021-10-11 02:31:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:14,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427810483] [2021-10-11 02:31:14,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:14,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:31:14,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049535257] [2021-10-11 02:31:14,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:31:14,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:31:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:14,957 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 5 states. [2021-10-11 02:31:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:15,109 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-10-11 02:31:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:31:15,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-10-11 02:31:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:15,111 INFO L225 Difference]: With dead ends: 48 [2021-10-11 02:31:15,111 INFO L226 Difference]: Without dead ends: 44 [2021-10-11 02:31:15,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:31:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-11 02:31:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-10-11 02:31:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:31:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-10-11 02:31:15,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 11 [2021-10-11 02:31:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:15,127 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-10-11 02:31:15,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:31:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-10-11 02:31:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:31:15,128 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:15,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:15,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:31:15,129 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1374572282, now seen corresponding path program 1 times [2021-10-11 02:31:15,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:15,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982737399] [2021-10-11 02:31:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:15,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982737399] [2021-10-11 02:31:15,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:15,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:31:15,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412568095] [2021-10-11 02:31:15,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:31:15,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:31:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:31:15,179 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2021-10-11 02:31:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:15,274 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2021-10-11 02:31:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:31:15,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 02:31:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:15,276 INFO L225 Difference]: With dead ends: 52 [2021-10-11 02:31:15,278 INFO L226 Difference]: Without dead ends: 50 [2021-10-11 02:31:15,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-11 02:31:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-10-11 02:31:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-10-11 02:31:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2021-10-11 02:31:15,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 13 [2021-10-11 02:31:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:15,299 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2021-10-11 02:31:15,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:31:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2021-10-11 02:31:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:31:15,301 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:15,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:15,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:31:15,304 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1548278464, now seen corresponding path program 1 times [2021-10-11 02:31:15,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:15,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945581849] [2021-10-11 02:31:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:15,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945581849] [2021-10-11 02:31:15,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:15,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:31:15,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759522173] [2021-10-11 02:31:15,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:31:15,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:31:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:15,422 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2021-10-11 02:31:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:15,598 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-10-11 02:31:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:31:15,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 02:31:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:15,603 INFO L225 Difference]: With dead ends: 70 [2021-10-11 02:31:15,603 INFO L226 Difference]: Without dead ends: 56 [2021-10-11 02:31:15,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:31:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-11 02:31:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2021-10-11 02:31:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 02:31:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-10-11 02:31:15,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 15 [2021-10-11 02:31:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:15,624 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-10-11 02:31:15,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:31:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-10-11 02:31:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:31:15,625 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:15,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:15,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:31:15,627 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1885807075, now seen corresponding path program 1 times [2021-10-11 02:31:15,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:15,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378486538] [2021-10-11 02:31:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:15,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378486538] [2021-10-11 02:31:15,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:15,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:31:15,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141879203] [2021-10-11 02:31:15,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:31:15,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:31:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:15,689 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2021-10-11 02:31:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:15,830 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-10-11 02:31:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:31:15,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 02:31:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:15,832 INFO L225 Difference]: With dead ends: 61 [2021-10-11 02:31:15,832 INFO L226 Difference]: Without dead ends: 59 [2021-10-11 02:31:15,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:31:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-10-11 02:31:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2021-10-11 02:31:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 02:31:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-10-11 02:31:15,840 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 15 [2021-10-11 02:31:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:15,840 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-10-11 02:31:15,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:31:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-10-11 02:31:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:31:15,841 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:15,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:15,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:31:15,842 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1105701117, now seen corresponding path program 1 times [2021-10-11 02:31:15,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:15,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308261151] [2021-10-11 02:31:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:15,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308261151] [2021-10-11 02:31:15,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271074058] [2021-10-11 02:31:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:16,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:31:16,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:16,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:31:16,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:31:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:16,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:16,130 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:16,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711683951] [2021-10-11 02:31:16,202 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:31:16,202 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:16,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:16,212 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:16,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:16,714 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:17,360 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:17,856 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-10-11 02:31:18,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:18,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 20 [2021-10-11 02:31:18,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356072294] [2021-10-11 02:31:18,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:31:18,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:31:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:31:18,175 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 13 states. [2021-10-11 02:31:18,492 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2021-10-11 02:31:18,842 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2021-10-11 02:31:19,136 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2021-10-11 02:31:19,339 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2021-10-11 02:31:19,482 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-10-11 02:31:19,650 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-10-11 02:31:19,827 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2021-10-11 02:31:20,068 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-10-11 02:31:20,310 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-10-11 02:31:20,564 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2021-10-11 02:31:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:20,785 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-10-11 02:31:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:31:20,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2021-10-11 02:31:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:20,787 INFO L225 Difference]: With dead ends: 52 [2021-10-11 02:31:20,787 INFO L226 Difference]: Without dead ends: 50 [2021-10-11 02:31:20,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2021-10-11 02:31:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-11 02:31:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-10-11 02:31:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-10-11 02:31:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-10-11 02:31:20,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2021-10-11 02:31:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:20,822 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-10-11 02:31:20,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:31:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-10-11 02:31:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:31:20,823 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:20,823 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:21,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:31:21,024 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1712391305, now seen corresponding path program 1 times [2021-10-11 02:31:21,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:21,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149208910] [2021-10-11 02:31:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:21,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149208910] [2021-10-11 02:31:21,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385407886] [2021-10-11 02:31:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:21,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 02:31:21,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:21,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:21,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1342610437] [2021-10-11 02:31:21,459 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:31:21,460 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:21,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:21,461 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:21,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:21,749 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:22,431 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:23,714 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:31:23,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:23,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2021-10-11 02:31:23,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580524811] [2021-10-11 02:31:23,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:31:23,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:23,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:31:23,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2021-10-11 02:31:23,717 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 16 states. [2021-10-11 02:31:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,654 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2021-10-11 02:31:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-11 02:31:24,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2021-10-11 02:31:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,660 INFO L225 Difference]: With dead ends: 115 [2021-10-11 02:31:24,660 INFO L226 Difference]: Without dead ends: 88 [2021-10-11 02:31:24,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=596, Invalid=3064, Unknown=0, NotChecked=0, Total=3660 [2021-10-11 02:31:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-10-11 02:31:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2021-10-11 02:31:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 02:31:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-10-11 02:31:24,676 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25 [2021-10-11 02:31:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,677 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-10-11 02:31:24,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:31:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-10-11 02:31:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:31:24,678 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,678 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-11 02:31:24,889 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1721694234, now seen corresponding path program 1 times [2021-10-11 02:31:24,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638783549] [2021-10-11 02:31:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638783549] [2021-10-11 02:31:24,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700281296] [2021-10-11 02:31:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:25,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:31:25,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:25,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:25,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666356853] [2021-10-11 02:31:25,193 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:31:25,194 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:25,194 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:25,194 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:25,195 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:25,391 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:26,109 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:26,816 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:31:26,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:26,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-10-11 02:31:26,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439796526] [2021-10-11 02:31:26,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:31:26,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:31:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:31:26,818 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 12 states. [2021-10-11 02:31:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:27,069 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-10-11 02:31:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:31:27,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2021-10-11 02:31:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:27,070 INFO L225 Difference]: With dead ends: 72 [2021-10-11 02:31:27,070 INFO L226 Difference]: Without dead ends: 70 [2021-10-11 02:31:27,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2021-10-11 02:31:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-11 02:31:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-10-11 02:31:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 02:31:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-10-11 02:31:27,084 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 25 [2021-10-11 02:31:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:27,084 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-10-11 02:31:27,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:31:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-10-11 02:31:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-11 02:31:27,086 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:27,086 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:27,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-10-11 02:31:27,289 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1856353681, now seen corresponding path program 2 times [2021-10-11 02:31:27,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:27,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810855868] [2021-10-11 02:31:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:27,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810855868] [2021-10-11 02:31:27,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732169601] [2021-10-11 02:31:27,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:27,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:31:27,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:27,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-11 02:31:27,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:27,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:28,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [441142173] [2021-10-11 02:31:28,061 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:31:28,061 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:28,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:28,062 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:28,062 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:28,289 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:29,103 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:29,586 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-10-11 02:31:30,058 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:31:30,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:30,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2021-10-11 02:31:30,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112549283] [2021-10-11 02:31:30,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-10-11 02:31:30,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-11 02:31:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2021-10-11 02:31:30,062 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 24 states. [2021-10-11 02:31:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:32,011 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2021-10-11 02:31:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-11 02:31:32,011 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2021-10-11 02:31:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:32,012 INFO L225 Difference]: With dead ends: 160 [2021-10-11 02:31:32,013 INFO L226 Difference]: Without dead ends: 158 [2021-10-11 02:31:32,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2021-10-11 02:31:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-11 02:31:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2021-10-11 02:31:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-10-11 02:31:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-10-11 02:31:32,033 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 35 [2021-10-11 02:31:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:32,033 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-10-11 02:31:32,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-10-11 02:31:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-10-11 02:31:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 02:31:32,035 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:32,035 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:32,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:32,261 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash 389853787, now seen corresponding path program 2 times [2021-10-11 02:31:32,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:32,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133617797] [2021-10-11 02:31:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:32,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133617797] [2021-10-11 02:31:32,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168528036] [2021-10-11 02:31:32,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:32,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:31:32,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:32,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-11 02:31:32,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:31:32,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:31:32,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721017679] [2021-10-11 02:31:32,750 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:31:32,750 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:32,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:32,751 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:32,751 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:32,964 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:33,638 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:34,827 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2021-10-11 02:31:35,086 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:31:35,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:35,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2021-10-11 02:31:35,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257492648] [2021-10-11 02:31:35,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-10-11 02:31:35,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:35,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-11 02:31:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2021-10-11 02:31:35,088 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 20 states. [2021-10-11 02:31:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:35,387 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-10-11 02:31:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:31:35,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2021-10-11 02:31:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:35,388 INFO L225 Difference]: With dead ends: 94 [2021-10-11 02:31:35,388 INFO L226 Difference]: Without dead ends: 76 [2021-10-11 02:31:35,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2021-10-11 02:31:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-10-11 02:31:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-10-11 02:31:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-10-11 02:31:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2021-10-11 02:31:35,403 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 45 [2021-10-11 02:31:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:35,404 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2021-10-11 02:31:35,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-10-11 02:31:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2021-10-11 02:31:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 02:31:35,407 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:35,407 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:35,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-10-11 02:31:35,617 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1017148397, now seen corresponding path program 3 times [2021-10-11 02:31:35,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:35,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838876178] [2021-10-11 02:31:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-10-11 02:31:35,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838876178] [2021-10-11 02:31:35,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215132806] [2021-10-11 02:31:35,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:31:35,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:31:35,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-11 02:31:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:36,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:36,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892475939] [2021-10-11 02:31:36,695 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:31:36,696 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:31:36,696 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:31:36,696 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:31:36,696 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:31:36,870 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:31:37,634 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2021-10-11 02:31:38,166 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-10-11 02:31:39,137 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:31:39,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:39,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2021-10-11 02:31:39,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730528591] [2021-10-11 02:31:39,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-10-11 02:31:39,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-11 02:31:39,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2021-10-11 02:31:39,140 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 31 states. [2021-10-11 02:31:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:42,116 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-10-11 02:31:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-10-11 02:31:42,116 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 75 [2021-10-11 02:31:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:42,117 INFO L225 Difference]: With dead ends: 129 [2021-10-11 02:31:42,117 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:31:42,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 180 SyntacticMatches, 19 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3714 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2074, Invalid=9268, Unknown=0, NotChecked=0, Total=11342 [2021-10-11 02:31:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:31:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:31:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:31:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:31:42,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-10-11 02:31:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:42,121 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:31:42,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-10-11 02:31:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:31:42,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:31:42,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:42,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:31:42,796 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2021-10-11 02:31:43,231 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 76 [2021-10-11 02:31:43,582 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-10-11 02:31:43,910 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-10-11 02:31:44,163 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2021-10-11 02:31:44,652 WARN L197 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2021-10-11 02:31:44,655 INFO L258 CegarLoopResult]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |#t~string0.base|))) (let ((.cse0 (= |#t~string1.offset| 0)) (.cse2 (= |#NULL.base| 0)) (.cse3 (= (select .cse21 |#t~string0.offset|) 48)) (.cse4 (= (select |#valid| 0) 0)) (.cse5 (= (select .cse21 (+ |#t~string0.offset| 1)) 0)) (.cse6 (<= ULTIMATE.start_main_~bufferlen~0 2147483647)) (.cse1 (+ ULTIMATE.start_main_~buflim~0 1)) (.cse7 (<= ULTIMATE.start_main_~inlen~0 2147483647)) (.cse8 (= (select |#length| |#t~string1.base|) 9)) (.cse9 (= 2 (select |#length| |#t~string0.base|))) (.cse10 (< 0 ULTIMATE.start_main_~inlen~0)) (.cse11 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse12 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse13 (= (select |#valid| |#t~string0.base|) 1)) (.cse14 (< 0 |#StackHeapBarrier|)) (.cse15 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse16 (<= 0 ULTIMATE.start_main_~in~0)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= (select |#valid| |#t~string1.base|) 1)) (.cse19 (= |#t~string0.offset| 0)) (.cse20 (<= 0 ULTIMATE.start_main_~buf~0))) (or (and .cse0 (< ULTIMATE.start_main_~buf~0 .cse1) .cse2 .cse3 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (= ULTIMATE.start_main_~buf~0 0) (<= 2 ULTIMATE.start_main_~bufferlen~0)) (and .cse0 .cse2 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) .cse3 .cse4 .cse5 .cse6 (<= 0 .cse1) .cse7 .cse8 (<= ULTIMATE.start_main_~buf~0 2) .cse9 (<= ULTIMATE.start_main_~buflim~0 2147483645) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-10-11 02:31:44,655 INFO L262 CegarLoopResult]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,655 INFO L258 CegarLoopResult]: At program point L18-20(lines 17 22) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0)) [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L265 CegarLoopResult]: At program point L18-23(lines 17 22) the Hoare annotation is: true [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-4(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-5(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-6(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point L19-7(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,656 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point L37-3(lines 37 48) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L265 CegarLoopResult]: At program point L55(lines 25 56) the Hoare annotation is: true [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point L39(lines 39 40) no Hoare annotation was computed. [2021-10-11 02:31:44,657 INFO L262 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point L32(lines 25 56) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-10-11 02:31:44,658 INFO L262 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,659 INFO L258 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |#t~string0.base|))) (let ((.cse0 (<= 0 |#NULL.offset|)) (.cse1 (= (select .cse20 |#t~string0.offset|) 48)) (.cse2 (= (select |#valid| 0) 0)) (.cse3 (<= ULTIMATE.start_main_~inlen~0 2147483647)) (.cse4 (<= |#t~string1.offset| 0)) (.cse5 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse7 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse8 (= (select |#valid| |#t~string1.base|) 1)) (.cse9 (<= |#NULL.base| 0)) (.cse10 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse11 (= (select .cse20 (+ |#t~string0.offset| 1)) 0)) (.cse12 (= (select |#length| |#t~string1.base|) 9)) (.cse13 (= 2 (select |#length| |#t~string0.base|))) (.cse14 (= (select |#valid| |#t~string0.base|) 1)) (.cse15 (< 0 |#StackHeapBarrier|)) (.cse16 (<= 0 |#t~string1.offset|)) (.cse17 (<= 0 |#NULL.base|)) (.cse18 (= |#t~string0.offset| 0)) (.cse19 (<= |#NULL.offset| 0))) (or (and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) .cse0 .cse1 .cse2 .cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_main_~buf~0) .cse9 .cse10 (<= 1 ULTIMATE.start_main_~in~0) .cse11 (<= ULTIMATE.start_main_~bufferlen~0 2147483647) .cse12 .cse13 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (= (ite (<= 0 ULTIMATE.start_main_~buf~0) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse7 .cse8 (= ULTIMATE.start_main_~in~0 0) .cse9 (= ULTIMATE.start_main_~buf~0 0) .cse10 .cse11 .cse12 .cse13 (<= 2 ULTIMATE.start_main_~bufferlen~0) .cse14 (not (= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-10-11 02:31:44,659 INFO L262 CegarLoopResult]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,659 INFO L258 CegarLoopResult]: At program point L18-5(lines 17 22) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |#t~string0.base|))) (and (= |#t~string1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| ULTIMATE.start___VERIFIER_assert_~cond) (= |#NULL.base| 0) (= (select .cse0 |#t~string0.offset|) 48) (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) (= (select |#valid| 0) 0) (= (select .cse0 (+ |#t~string0.offset| 1)) 0) (<= ULTIMATE.start_main_~bufferlen~0 2147483647) (<= ULTIMATE.start_main_~inlen~0 2147483647) (= (select |#length| |#t~string1.base|) 9) (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0) (= 2 (select |#length| |#t~string0.base|)) (< |#StackHeapBarrier| |#t~string0.base|) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) (= (select |#valid| |#t~string0.base|) 1) (< 0 |#StackHeapBarrier|) (< |#StackHeapBarrier| |#t~string1.base|) (<= 0 ULTIMATE.start_main_~in~0) (= |#NULL.offset| 0) (= (select |#valid| |#t~string1.base|) 1) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= |#t~string0.offset| 0) (<= 0 ULTIMATE.start_main_~buf~0))) [2021-10-11 02:31:44,660 INFO L262 CegarLoopResult]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,660 INFO L258 CegarLoopResult]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |#t~string0.base|))) (and (= |#t~string1.offset| 0) (< ULTIMATE.start_main_~buf~0 (+ ULTIMATE.start_main_~buflim~0 1)) (= |#NULL.base| 0) (= (select .cse0 |#t~string0.offset|) 48) (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) (= (select |#valid| 0) 0) (<= 1 ULTIMATE.start_main_~in~0) (= (select .cse0 (+ |#t~string0.offset| 1)) 0) (<= ULTIMATE.start_main_~bufferlen~0 2147483647) (<= ULTIMATE.start_main_~inlen~0 2147483647) (= (select |#length| |#t~string1.base|) 9) (= 2 (select |#length| |#t~string0.base|)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< |#StackHeapBarrier| |#t~string0.base|) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) (= (select |#valid| |#t~string0.base|) 1) (< 0 |#StackHeapBarrier|) (< |#StackHeapBarrier| |#t~string1.base|) (= |#NULL.offset| 0) (= (select |#valid| |#t~string1.base|) 1) (<= 1 ULTIMATE.start_main_~buf~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= |#t~string0.offset| 0))) [2021-10-11 02:31:44,660 INFO L262 CegarLoopResult]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,660 INFO L258 CegarLoopResult]: At program point L18-11(lines 17 48) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |#t~string0.base|))) (let ((.cse8 (<= |#NULL.base| 0)) (.cse0 (<= 0 |#NULL.offset|)) (.cse1 (= (select .cse19 |#t~string0.offset|) 48)) (.cse9 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2))) (.cse10 (= (select .cse19 (+ |#t~string0.offset| 1)) 0)) (.cse2 (= (select |#valid| 0) 0)) (.cse3 (<= ULTIMATE.start_main_~inlen~0 2147483647)) (.cse11 (= (select |#length| |#t~string1.base|) 9)) (.cse12 (= 2 (select |#length| |#t~string0.base|))) (.cse4 (<= |#t~string1.offset| 0)) (.cse5 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse13 (= (select |#valid| |#t~string0.base|) 1)) (.cse14 (< 0 |#StackHeapBarrier|)) (.cse15 (<= 0 |#t~string1.offset|)) (.cse16 (<= 0 |#NULL.base|)) (.cse6 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse7 (= (select |#valid| |#t~string1.base|) 1)) (.cse17 (= |#t~string0.offset| 0)) (.cse18 (<= |#NULL.offset| 0))) (or (and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (< ULTIMATE.start_main_~buf~0 (+ ULTIMATE.start_main_~buflim~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse6 .cse7 (<= 1 ULTIMATE.start_main_~buf~0) .cse8 .cse9 (<= 1 ULTIMATE.start_main_~in~0) .cse10 (<= ULTIMATE.start_main_~bufferlen~0 2147483647) .cse11 .cse12 .cse13 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~inlen~0 ULTIMATE.start_main_~buf~0)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse8 (= ULTIMATE.start_main_~buf~0 0) .cse0 .cse1 .cse9 .cse10 .cse2 .cse3 .cse11 .cse12 .cse4 .cse5 .cse13 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse14 .cse15 .cse16 .cse6 (<= 0 ULTIMATE.start_main_~buflim~0) .cse7 .cse17 (= ULTIMATE.start_main_~in~0 0) .cse18)))) [2021-10-11 02:31:44,660 INFO L262 CegarLoopResult]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,661 INFO L258 CegarLoopResult]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |#t~string0.base|))) (let ((.cse0 (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) (.cse2 (<= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1)) (.cse3 (<= 0 |#NULL.offset|)) (.cse4 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (= (select .cse27 |#t~string0.offset|) 48)) (.cse6 (= (select |#valid| 0) 0)) (.cse7 (<= ULTIMATE.start_main_~inlen~0 2147483647)) (.cse8 (<= |#t~string1.offset| 0)) (.cse9 (< |#StackHeapBarrier| |#t~string0.base|)) (.cse10 (< ULTIMATE.start_main_~in~0 ULTIMATE.start_main_~inlen~0)) (.cse11 (<= ULTIMATE.start___VERIFIER_assert_~cond 1)) (.cse12 (< |#StackHeapBarrier| |#t~string1.base|)) (.cse13 (= (select |#valid| |#t~string1.base|) 1)) (.cse14 (<= 1 ULTIMATE.start_main_~buf~0)) (.cse15 (<= |#NULL.base| 0)) (.cse16 (<= 1 ULTIMATE.start_main_~in~0)) (.cse17 (= (select .cse27 (+ |#t~string0.offset| 1)) 0)) (.cse18 (<= ULTIMATE.start_main_~bufferlen~0 2147483647)) (.cse1 (+ ULTIMATE.start_main_~buflim~0 1)) (.cse19 (= (select |#length| |#t~string1.base|) 9)) (.cse20 (= 2 (select |#length| |#t~string0.base|))) (.cse21 (= (select |#valid| |#t~string0.base|) 1)) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse23 (<= 0 |#t~string1.offset|)) (.cse24 (<= 0 |#NULL.base|)) (.cse25 (= |#t~string0.offset| 0)) (.cse26 (<= |#NULL.offset| 0))) (or (and .cse0 (< ULTIMATE.start_main_~buf~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_main_~bufferlen~0 (+ ULTIMATE.start_main_~buflim~0 2)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (= ULTIMATE.start_main_~buf~0 0) (<= 2 ULTIMATE.start_main_~bufferlen~0) (= ULTIMATE.start_main_~in~0 0)) (and .cse0 .cse2 (not (= .cse1 ULTIMATE.start_main_~buf~0)) (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~buflim~0 2147483645) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 .cse1) .cse19 (<= ULTIMATE.start_main_~buf~0 2) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2021-10-11 02:31:44,661 INFO L262 CegarLoopResult]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2021-10-11 02:31:44,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:31:44 BoogieIcfgContainer [2021-10-11 02:31:44,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:31:44,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:31:44,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:31:44,706 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:31:44,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:14" (3/4) ... [2021-10-11 02:31:44,709 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:31:44,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-10-11 02:31:44,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-11 02:31:44,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-11 02:31:44,721 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:31:44,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && buf < buflim + 1) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && 1 == cond) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && buflim + in + 3 <= inlen + buf) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || ((((((((((((((((((((((#NULL <= 0 && buf == 0) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && \valid[0] == 0) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && bufferlen < inlen) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= buflim) && \valid["assert.h"] == 1) && "0" == 0) && in == 0) && #NULL <= 0) [2021-10-11 02:31:44,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((1 <= \old(cond) && buf < buflim + 1) && \old(cond) <= 1) && 0 <= #NULL) && 1 <= cond) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && in < inlen) && cond <= 1) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || (((!(0 == cond) && buf == 0) && 2 <= bufferlen) && in == 0)) || ((((((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && !(buflim + 1 == buf)) && buf + 2 <= bufferlen) && 0 <= #NULL) && 1 <= cond) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && buflim <= 2147483645) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && in < inlen) && cond <= 1) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && 0 <= buflim + 1) && unknown-#length-unknown["assert.h"] == 9) && buf <= 2) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) [2021-10-11 02:31:44,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && buf < buflim) && "assert.h" <= 0) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || ((((((((((((((((((((((((((if 0 <= buf then 1 else 0) == \old(cond) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && bufferlen < inlen) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && in == 0) && #NULL <= 0) && buf == 0) && bufferlen == buflim + 2) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && 2 <= bufferlen) && \valid["0"] == 1) && !(buf == buflim)) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) [2021-10-11 02:31:44,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((("assert.h" == 0 && \old(cond) == cond) && #NULL == 0) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && \valid[0] == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && buf < buflim) && 2 == unknown-#length-unknown["0"]) && unknown-#StackHeapBarrier-unknown < "0") && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= in) && #NULL == 0) && \valid["assert.h"] == 1) && \old(cond) == 1) && "0" == 0) && 0 <= buf [2021-10-11 02:31:44,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((("assert.h" == 0 && buf < buflim + 1) && #NULL == 0) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && \valid[0] == 0) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && #NULL == 0) && \valid["assert.h"] == 1) && 1 <= buf) && \old(cond) == 1) && "0" == 0 [2021-10-11 02:31:44,763 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d564454-b449-4e68-ba45-47d4573dc3fe/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:31:44,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:31:44,764 INFO L168 Benchmark]: Toolchain (without parser) took 31179.19 ms. Allocated memory was 94.4 MB in the beginning and 327.2 MB in the end (delta: 232.8 MB). Free memory was 64.2 MB in the beginning and 288.8 MB in the end (delta: -224.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,765 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 94.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:31:44,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.42 ms. Allocated memory was 94.4 MB in the beginning and 130.0 MB in the end (delta: 35.7 MB). Free memory was 64.2 MB in the beginning and 106.1 MB in the end (delta: -42.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.76 ms. Allocated memory is still 130.0 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:31:44,766 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 130.0 MB. Free memory was 104.0 MB in the beginning and 103.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,766 INFO L168 Benchmark]: RCFGBuilder took 405.67 ms. Allocated memory is still 130.0 MB. Free memory was 103.0 MB in the beginning and 84.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,767 INFO L168 Benchmark]: TraceAbstraction took 30380.26 ms. Allocated memory was 130.0 MB in the beginning and 327.2 MB in the end (delta: 197.1 MB). Free memory was 83.6 MB in the beginning and 293.0 MB in the end (delta: -209.4 MB). Peak memory consumption was 173.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,767 INFO L168 Benchmark]: Witness Printer took 58.26 ms. Allocated memory is still 327.2 MB. Free memory was 293.0 MB in the beginning and 288.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:44,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 94.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 260.42 ms. Allocated memory was 94.4 MB in the beginning and 130.0 MB in the end (delta: 35.7 MB). Free memory was 64.2 MB in the beginning and 106.1 MB in the end (delta: -42.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.76 ms. Allocated memory is still 130.0 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 130.0 MB. Free memory was 104.0 MB in the beginning and 103.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 405.67 ms. Allocated memory is still 130.0 MB. Free memory was 103.0 MB in the beginning and 84.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30380.26 ms. Allocated memory was 130.0 MB in the beginning and 327.2 MB in the end (delta: 197.1 MB). Free memory was 83.6 MB in the beginning and 293.0 MB in the end (delta: -209.4 MB). Peak memory consumption was 173.8 MB. Max. memory is 16.1 GB. * Witness Printer took 58.26 ms. Allocated memory is still 327.2 MB. Free memory was 293.0 MB in the beginning and 288.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((((((("assert.h" == 0 && buf < buflim + 1) && #NULL == 0) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && \valid[0] == 0) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && #NULL == 0) && \valid["assert.h"] == 1) && 1 <= buf) && \old(cond) == 1) && "0" == 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && buf < buflim) && "assert.h" <= 0) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || ((((((((((((((((((((((((((if 0 <= buf then 1 else 0) == \old(cond) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && bufferlen < inlen) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && in == 0) && #NULL <= 0) && buf == 0) && bufferlen == buflim + 2) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && 2 <= bufferlen) && \valid["0"] == 1) && !(buf == buflim)) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((((((((((("assert.h" == 0 && buf < buflim + 1) && #NULL == 0) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && \valid[0] == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && 0 < inlen) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= in) && #NULL == 0) && \valid["assert.h"] == 1) && "0" == 0) && 0 <= buf) || ((!(0 == cond) && buf == 0) && 2 <= bufferlen)) || ((((((((((((((((((((((("assert.h" == 0 && #NULL == 0) && buf + 2 <= bufferlen) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && 0 <= buflim + 1) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && buf <= 2) && 2 == unknown-#length-unknown["0"]) && buflim <= 2147483645) && 0 < inlen) && 1 == cond) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= in) && #NULL == 0) && \valid["assert.h"] == 1) && "0" == 0) && 0 <= buf) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && buf < buflim + 1) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && 1 == cond) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && buflim + in + 3 <= inlen + buf) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || ((((((((((((((((((((((#NULL <= 0 && buf == 0) && 0 <= #NULL) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && \valid[0] == 0) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && \valid["0"] == 1) && bufferlen < inlen) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= buflim) && \valid["assert.h"] == 1) && "0" == 0) && in == 0) && #NULL <= 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((((((("assert.h" == 0 && \old(cond) == cond) && #NULL == 0) && unknown-#memory_int-unknown["0"]["0"] == 48) && bufferlen == buflim + 2) && \valid[0] == 0) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && inlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && buf < buflim) && 2 == unknown-#length-unknown["0"]) && unknown-#StackHeapBarrier-unknown < "0") && buflim + in + 3 <= inlen + buf) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && unknown-#StackHeapBarrier-unknown < "assert.h") && 0 <= in) && #NULL == 0) && \valid["assert.h"] == 1) && \old(cond) == 1) && "0" == 0) && 0 <= buf - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((!(0 == cond) && buf + 1 <= bufferlen) && 2 <= bufferlen) && 0 <= buf - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((1 <= \old(cond) && buf < buflim + 1) && \old(cond) <= 1) && 0 <= #NULL) && 1 <= cond) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && in < inlen) && cond <= 1) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && bufferlen == buflim + 2) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && unknown-#length-unknown["assert.h"] == 9) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) || (((!(0 == cond) && buf == 0) && 2 <= bufferlen) && in == 0)) || ((((((((((((((((((((((((((((((1 <= \old(cond) && \old(cond) <= 1) && !(buflim + 1 == buf)) && buf + 2 <= bufferlen) && 0 <= #NULL) && 1 <= cond) && unknown-#memory_int-unknown["0"]["0"] == 48) && \valid[0] == 0) && inlen <= 2147483647) && buflim <= 2147483645) && "assert.h" <= 0) && unknown-#StackHeapBarrier-unknown < "0") && in < inlen) && cond <= 1) && unknown-#StackHeapBarrier-unknown < "assert.h") && \valid["assert.h"] == 1) && 1 <= buf) && #NULL <= 0) && 1 <= in) && unknown-#memory_int-unknown["0"]["0" + 1] == 0) && bufferlen <= 2147483647) && 0 <= buflim + 1) && unknown-#length-unknown["assert.h"] == 9) && buf <= 2) && 2 == unknown-#length-unknown["0"]) && \valid["0"] == 1) && 0 < unknown-#StackHeapBarrier-unknown) && 0 <= "assert.h") && 0 <= #NULL) && "0" == 0) && #NULL <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.9s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 1333 SDslu, 1211 SDs, 0 SdLazy, 1766 SolverSat, 735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 504 SyntacticMatches, 57 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8544 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 75 NumberOfFragments, 1080 HoareAnnotationTreeSize, 9 FomulaSimplifications, 33002 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1931 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 527 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 268499 SizeOfPredicates, 47 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 88/888 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 513, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 35, TOOLS_POST_TIME[ms]: 266, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 35, TOOLS_QUANTIFIERELIM_TIME[ms]: 254, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 111, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 55, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 82, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 88, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 5, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 19, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 208, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 208, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 12, DAG_COMPRESSION_PROCESSED_NODES: 176, DAG_COMPRESSION_RETAINED_NODES: 48, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...