./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c --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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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 c66b9d1e2f6d9fc677cf33b6edee94991686d987 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:01,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:23:01,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:23:01,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:23:01,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:23:01,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:23:01,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:23:01,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:23:01,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:23:01,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:23:01,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:23:01,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:23:01,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:23:01,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:23:01,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:23:01,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:23:01,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:23:01,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:23:01,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:23:01,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:23:01,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:23:01,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:23:01,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:23:01,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:23:01,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:23:01,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:23:01,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:23:01,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:23:01,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:23:01,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:23:01,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:23:01,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:23:01,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:23:01,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:23:01,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:23:01,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:23:01,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:23:01,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:23:01,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:23:01,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:23:01,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:23:01,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:23:01,271 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:23:01,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:23:01,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:23:01,273 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:23:01,273 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:23:01,274 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:23:01,274 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:23:01,274 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:23:01,274 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:23:01,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:23:01,282 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:23:01,282 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:23:01,283 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:23:01,283 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:23:01,283 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:23:01,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:23:01,284 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:23:01,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:23:01,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:23:01,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:23:01,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:23:01,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:23:01,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:23:01,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:23:01,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:23:01,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:23:01,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:23:01,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:23:01,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:23:01,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:23:01,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:01,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:23:01,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:23:01,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:23:01,290 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:23:01,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:23:01,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:23:01,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:23:01,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:23:01,292 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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 -> c66b9d1e2f6d9fc677cf33b6edee94991686d987 [2021-10-11 02:23:01,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:23:01,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:23:01,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:23:01,616 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:23:01,616 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:23:01,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2021-10-11 02:23:01,702 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/data/e0bb5a32d/8a83522ae6644872a8e4e685645ae65b/FLAG0facc7041 [2021-10-11 02:23:02,265 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:23:02,265 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2021-10-11 02:23:02,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/data/e0bb5a32d/8a83522ae6644872a8e4e685645ae65b/FLAG0facc7041 [2021-10-11 02:23:02,644 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/data/e0bb5a32d/8a83522ae6644872a8e4e685645ae65b [2021-10-11 02:23:02,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:23:02,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:23:02,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:02,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:23:02,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:23:02,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7585fa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02, skipping insertion in model container [2021-10-11 02:23:02,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:23:02,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:23:02,845 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c[454,467] [2021-10-11 02:23:02,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:02,858 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:23:02,896 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c[454,467] [2021-10-11 02:23:02,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:02,913 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:23:02,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02 WrapperNode [2021-10-11 02:23:02,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:02,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:02,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:23:02,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:23:02,931 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:23:02" (1/1) ... [2021-10-11 02:23:02,940 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:23:02" (1/1) ... [2021-10-11 02:23:02,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:02,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:23:02,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:23:02,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:23:02,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... [2021-10-11 02:23:02,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:23:02,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:23:02,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:23:02,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:23:02,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:23:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:23:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:23:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure id [2021-10-11 02:23:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2021-10-11 02:23:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:23:03,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:23:03,410 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:23:03,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:03 BoogieIcfgContainer [2021-10-11 02:23:03,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:23:03,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:23:03,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:23:03,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:23:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:23:02" (1/3) ... [2021-10-11 02:23:03,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e611494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:03, skipping insertion in model container [2021-10-11 02:23:03,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:02" (2/3) ... [2021-10-11 02:23:03,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e611494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:03, skipping insertion in model container [2021-10-11 02:23:03,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:03" (3/3) ... [2021-10-11 02:23:03,435 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2021-10-11 02:23:03,462 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:23:03,465 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:23:03,491 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:23:03,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:23:03,516 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:23:03,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:23:03,516 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:23:03,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:23:03,517 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:23:03,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:23:03,517 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2021-10-11 02:23:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:23:03,541 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:03,544 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2021-10-11 02:23:03,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349489359] [2021-10-11 02:23:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,826 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:23:03,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349489359] [2021-10-11 02:23:03,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:03,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135416280] [2021-10-11 02:23:03,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:03,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:03,857 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2021-10-11 02:23:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,975 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-10-11 02:23:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:03,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:23:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,987 INFO L225 Difference]: With dead ends: 22 [2021-10-11 02:23:03,987 INFO L226 Difference]: Without dead ends: 14 [2021-10-11 02:23:03,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-10-11 02:23:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-11 02:23:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-11 02:23:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-10-11 02:23:04,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-10-11 02:23:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,041 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-10-11 02:23:04,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-10-11 02:23:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:23:04,044 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,044 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:04,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:04,045 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2021-10-11 02:23:04,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821546333] [2021-10-11 02:23:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:04,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821546333] [2021-10-11 02:23:04,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643141084] [2021-10-11 02:23:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:23:04,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:23:04,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:23:04,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930422948] [2021-10-11 02:23:04,663 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:04,663 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:04,669 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:04,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:04,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-11 02:23:04,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650913285] [2021-10-11 02:23:04,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:04,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:04,682 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2021-10-11 02:23:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,794 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-10-11 02:23:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:04,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2021-10-11 02:23:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,800 INFO L225 Difference]: With dead ends: 21 [2021-10-11 02:23:04,800 INFO L226 Difference]: Without dead ends: 17 [2021-10-11 02:23:04,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:23:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-11 02:23:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 02:23:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:23:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-10-11 02:23:04,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-10-11 02:23:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,807 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-11 02:23:04,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-10-11 02:23:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:23:04,808 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,809 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:05,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-11 02:23:05,037 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2021-10-11 02:23:05,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80742007] [2021-10-11 02:23:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:05,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80742007] [2021-10-11 02:23:05,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574843919] [2021-10-11 02:23:05,161 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:05,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:23:05,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:05,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:23:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:05,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:23:05,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1194357929] [2021-10-11 02:23:05,709 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:05,709 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:05,709 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:05,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:05,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-11 02:23:05,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208259245] [2021-10-11 02:23:05,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:23:05,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:23:05,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:23:05,712 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2021-10-11 02:23:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,808 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-10-11 02:23:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:05,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2021-10-11 02:23:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,810 INFO L225 Difference]: With dead ends: 24 [2021-10-11 02:23:05,810 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 02:23:05,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 02:23:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 02:23:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 02:23:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-11 02:23:05,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2021-10-11 02:23:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,817 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-11 02:23:05,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:23:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-11 02:23:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:05,819 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,819 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:06,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:06,045 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2021-10-11 02:23:06,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31036132] [2021-10-11 02:23:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:23:06,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31036132] [2021-10-11 02:23:06,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764709550] [2021-10-11 02:23:06,173 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:06,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:23:06,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:06,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:23:06,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:23:06,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:23:06,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648425319] [2021-10-11 02:23:06,938 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:06,938 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:06,939 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:06,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:06,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-11 02:23:06,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167681098] [2021-10-11 02:23:06,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:23:06,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:23:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:23:06,941 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2021-10-11 02:23:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,034 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-10-11 02:23:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:23:07,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2021-10-11 02:23:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,037 INFO L225 Difference]: With dead ends: 27 [2021-10-11 02:23:07,037 INFO L226 Difference]: Without dead ends: 23 [2021-10-11 02:23:07,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:23:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-10-11 02:23:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-10-11 02:23:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-11 02:23:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-10-11 02:23:07,044 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2021-10-11 02:23:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,044 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-11 02:23:07,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:23:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-10-11 02:23:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-11 02:23:07,046 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,046 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:07,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:07,261 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2021-10-11 02:23:07,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412099656] [2021-10-11 02:23:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-11 02:23:07,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412099656] [2021-10-11 02:23:07,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808460291] [2021-10-11 02:23:07,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-11 02:23:07,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-11 02:23:07,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:23:08,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687379503] [2021-10-11 02:23:08,390 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:08,390 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:08,391 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:08,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:08,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2021-10-11 02:23:08,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917205320] [2021-10-11 02:23:08,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-10-11 02:23:08,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-11 02:23:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:23:08,395 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2021-10-11 02:23:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,511 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-10-11 02:23:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:08,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2021-10-11 02:23:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,516 INFO L225 Difference]: With dead ends: 30 [2021-10-11 02:23:08,516 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:23:08,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:23:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:23:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:23:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:23:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-10-11 02:23:08,530 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2021-10-11 02:23:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,531 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-10-11 02:23:08,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-10-11 02:23:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-10-11 02:23:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:23:08,534 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,535 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:08,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:08,757 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2021-10-11 02:23:08,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182880773] [2021-10-11 02:23:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-11 02:23:08,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182880773] [2021-10-11 02:23:08,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424195837] [2021-10-11 02:23:08,894 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:08,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-11 02:23:08,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:08,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:23:08,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-11 02:23:09,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:23:10,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544396578] [2021-10-11 02:23:10,346 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:10,346 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:10,346 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:10,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:10,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2021-10-11 02:23:10,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784228423] [2021-10-11 02:23:10,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-10-11 02:23:10,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-11 02:23:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:23:10,350 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2021-10-11 02:23:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,480 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2021-10-11 02:23:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:23:10,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2021-10-11 02:23:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,485 INFO L225 Difference]: With dead ends: 33 [2021-10-11 02:23:10,485 INFO L226 Difference]: Without dead ends: 29 [2021-10-11 02:23:10,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:23:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-10-11 02:23:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-10-11 02:23:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-10-11 02:23:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-10-11 02:23:10,497 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2021-10-11 02:23:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,498 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-10-11 02:23:10,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-10-11 02:23:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-10-11 02:23:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 02:23:10,499 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,499 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-11 02:23:10,725 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2021-10-11 02:23:10,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560147712] [2021-10-11 02:23:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-11 02:23:10,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560147712] [2021-10-11 02:23:10,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107931182] [2021-10-11 02:23:10,860 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/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:23:10,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:23:10,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:10,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-11 02:23:10,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-11 02:23:11,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-11 02:23:12,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1312057182] [2021-10-11 02:23:12,872 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:12,872 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:12,872 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:12,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:12,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2021-10-11 02:23:12,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665581455] [2021-10-11 02:23:12,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-10-11 02:23:12,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-11 02:23:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-11 02:23:12,875 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2021-10-11 02:23:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,033 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-10-11 02:23:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:23:13,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2021-10-11 02:23:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,035 INFO L225 Difference]: With dead ends: 36 [2021-10-11 02:23:13,035 INFO L226 Difference]: Without dead ends: 32 [2021-10-11 02:23:13,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-10-11 02:23:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-11 02:23:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-11 02:23:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:23:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-11 02:23:13,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2021-10-11 02:23:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,041 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-11 02:23:13,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-10-11 02:23:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-11 02:23:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:23:13,043 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,044 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:13,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:13,269 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2021-10-11 02:23:13,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733845915] [2021-10-11 02:23:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-11 02:23:13,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733845915] [2021-10-11 02:23:13,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657342513] [2021-10-11 02:23:13,455 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-11 02:23:13,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-11 02:23:13,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-11 02:23:16,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23445638] [2021-10-11 02:23:16,162 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:16,162 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:16,162 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:16,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:16,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2021-10-11 02:23:16,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185192512] [2021-10-11 02:23:16,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:23:16,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:23:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:23:16,165 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2021-10-11 02:23:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,375 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-10-11 02:23:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:23:16,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2021-10-11 02:23:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,380 INFO L225 Difference]: With dead ends: 39 [2021-10-11 02:23:16,380 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:23:16,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:23:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:23:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-11 02:23:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:23:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-10-11 02:23:16,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2021-10-11 02:23:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,392 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-10-11 02:23:16,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:23:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-10-11 02:23:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:23:16,396 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,396 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:16,609 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2021-10-11 02:23:16,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058561969] [2021-10-11 02:23:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-11 02:23:16,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058561969] [2021-10-11 02:23:16,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769478791] [2021-10-11 02:23:16,761 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:16,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-10-11 02:23:16,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:16,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-11 02:23:16,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-11 02:23:17,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-11 02:23:20,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187901885] [2021-10-11 02:23:20,013 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:20,013 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:20,014 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:20,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:20,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2021-10-11 02:23:20,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333137535] [2021-10-11 02:23:20,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:23:20,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:23:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:23:20,016 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2021-10-11 02:23:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:20,215 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-10-11 02:23:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:23:20,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2021-10-11 02:23:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:20,220 INFO L225 Difference]: With dead ends: 42 [2021-10-11 02:23:20,220 INFO L226 Difference]: Without dead ends: 38 [2021-10-11 02:23:20,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2021-10-11 02:23:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-11 02:23:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-11 02:23:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-11 02:23:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-11 02:23:20,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2021-10-11 02:23:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:20,243 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-11 02:23:20,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:23:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-11 02:23:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 02:23:20,249 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:20,250 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:20,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-11 02:23:20,480 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2021-10-11 02:23:20,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:20,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014220136] [2021-10-11 02:23:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-11 02:23:20,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014220136] [2021-10-11 02:23:20,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210247489] [2021-10-11 02:23:20,665 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_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:20,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:23:20,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:23:20,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-11 02:23:20,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-11 02:23:20,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-11 02:23:24,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290022169] [2021-10-11 02:23:24,782 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:24,782 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:24,782 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:24,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:24,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2021-10-11 02:23:24,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002429189] [2021-10-11 02:23:24,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-10-11 02:23:24,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-11 02:23:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:23:24,786 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2021-10-11 02:23:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:25,026 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-10-11 02:23:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-11 02:23:25,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2021-10-11 02:23:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:25,028 INFO L225 Difference]: With dead ends: 45 [2021-10-11 02:23:25,028 INFO L226 Difference]: Without dead ends: 41 [2021-10-11 02:23:25,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:23:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-10-11 02:23:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-10-11 02:23:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-10-11 02:23:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-10-11 02:23:25,034 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2021-10-11 02:23:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:25,034 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-10-11 02:23:25,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-10-11 02:23:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-10-11 02:23:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-11 02:23:25,035 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:25,036 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:25,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:25,245 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2021-10-11 02:23:25,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:25,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455822121] [2021-10-11 02:23:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-10-11 02:23:25,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455822121] [2021-10-11 02:23:25,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873598298] [2021-10-11 02:23:25,732 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:25,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 47 conjunts are in the unsatisfiable core [2021-10-11 02:23:25,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-10-11 02:23:26,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-10-11 02:23:27,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316771070] [2021-10-11 02:23:27,186 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:27,186 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:27,186 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:23:27,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:27,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2021-10-11 02:23:27,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716778232] [2021-10-11 02:23:27,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-10-11 02:23:27,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:27,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-11 02:23:27,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:23:27,189 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 25 states. [2021-10-11 02:23:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:27,462 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-10-11 02:23:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-11 02:23:27,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2021-10-11 02:23:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:27,463 INFO L225 Difference]: With dead ends: 48 [2021-10-11 02:23:27,463 INFO L226 Difference]: Without dead ends: 44 [2021-10-11 02:23:27,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:23:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-11 02:23:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-10-11 02:23:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-10-11 02:23:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-10-11 02:23:27,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2021-10-11 02:23:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:27,469 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-10-11 02:23:27,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-10-11 02:23:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-10-11 02:23:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 02:23:27,470 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:27,471 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:27,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:27,693 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2021-10-11 02:23:27,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:27,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70100422] [2021-10-11 02:23:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-10-11 02:23:27,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70100422] [2021-10-11 02:23:27,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:27,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-11 02:23:27,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113962237] [2021-10-11 02:23:27,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:23:27,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:23:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:23:27,922 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2021-10-11 02:23:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:28,121 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2021-10-11 02:23:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:23:28,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2021-10-11 02:23:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:28,122 INFO L225 Difference]: With dead ends: 44 [2021-10-11 02:23:28,122 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:23:28,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:23:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:23:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:23:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:23:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:23:28,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2021-10-11 02:23:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:28,124 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:23:28,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:23:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:23:28,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:23:28,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:23:28,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:23:28,154 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L258 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 10 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 10)) [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point L11(lines 11 17) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point idFINAL(lines 6 9) no Hoare annotation was computed. [2021-10-11 02:23:28,155 INFO L262 CegarLoopResult]: For program point idEXIT(lines 6 9) no Hoare annotation was computed. [2021-10-11 02:23:28,156 INFO L258 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (and (<= id_~x |id_#in~x|) (<= |id_#in~x| id_~x)) [2021-10-11 02:23:28,156 INFO L265 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2021-10-11 02:23:28,156 INFO L262 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2021-10-11 02:23:28,156 INFO L262 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2021-10-11 02:23:28,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:28 BoogieIcfgContainer [2021-10-11 02:23:28,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:28,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:28,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:28,160 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:28,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:03" (3/4) ... [2021-10-11 02:23:28,163 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:23:28,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2021-10-11 02:23:28,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:23:28,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:23:28,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:23:28,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:23:28,202 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ce4866b-7ac8-4a6f-a032-af9bf1b740a0/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:28,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:28,204 INFO L168 Benchmark]: Toolchain (without parser) took 25554.60 ms. Allocated memory was 134.2 MB in the beginning and 339.7 MB in the end (delta: 205.5 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 149.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,204 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 86.0 MB. Free memory is still 41.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:28,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.01 ms. Allocated memory is still 134.2 MB. Free memory was 100.0 MB in the beginning and 109.0 MB in the end (delta: -9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.29 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,205 INFO L168 Benchmark]: Boogie Preprocessor took 29.12 ms. Allocated memory is still 134.2 MB. Free memory was 107.8 MB in the beginning and 106.8 MB in the end (delta: 944.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:28,206 INFO L168 Benchmark]: RCFGBuilder took 422.55 ms. Allocated memory is still 134.2 MB. Free memory was 106.8 MB in the beginning and 94.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,206 INFO L168 Benchmark]: TraceAbstraction took 24745.57 ms. Allocated memory was 134.2 MB in the beginning and 339.7 MB in the end (delta: 205.5 MB). Free memory was 93.8 MB in the beginning and 158.7 MB in the end (delta: -64.8 MB). Peak memory consumption was 143.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,207 INFO L168 Benchmark]: Witness Printer took 42.60 ms. Allocated memory is still 339.7 MB. Free memory was 158.7 MB in the beginning and 155.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,209 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.24 ms. Allocated memory is still 86.0 MB. Free memory is still 41.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 265.01 ms. Allocated memory is still 134.2 MB. Free memory was 100.0 MB in the beginning and 109.0 MB in the end (delta: -9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.29 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.12 ms. Allocated memory is still 134.2 MB. Free memory was 107.8 MB in the beginning and 106.8 MB in the end (delta: 944.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 422.55 ms. Allocated memory is still 134.2 MB. Free memory was 106.8 MB in the beginning and 94.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24745.57 ms. Allocated memory was 134.2 MB in the beginning and 339.7 MB in the end (delta: 205.5 MB). Free memory was 93.8 MB in the beginning and 158.7 MB in the end (delta: -64.8 MB). Peak memory consumption was 143.6 MB. Max. memory is 16.1 GB. * Witness Printer took 42.60 ms. Allocated memory is still 339.7 MB. Free memory was 158.7 MB in the beginning and 155.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.6s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 150 SDtfs, 545 SDslu, 1068 SDs, 0 SdLazy, 875 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1079 GetRequests, 831 SyntacticMatches, 7 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=11, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 201080 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1290 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 1904/4004 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: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...