./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8 --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 2d8f12063511b3e3f39f22e34c8c81c8d42f35e2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:44:04,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:44:04,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:44:04,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:44:04,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:44:04,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:44:04,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:44:04,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:44:04,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:44:04,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:44:04,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:44:04,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:44:04,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:44:04,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:44:04,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:44:04,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:44:04,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:44:04,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:44:04,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:44:04,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:44:04,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:44:04,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:44:04,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:44:04,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:44:04,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:44:04,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:44:04,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:44:04,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:44:04,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:44:04,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:44:04,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:44:04,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:44:04,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:44:04,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:44:04,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:44:04,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:44:04,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:44:04,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:44:04,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:44:04,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:44:04,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:44:04,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 06:44:04,247 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:44:04,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:44:04,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:44:04,248 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:44:04,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:44:04,248 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:44:04,249 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:44:04,249 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:44:04,249 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:44:04,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:44:04,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:44:04,250 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:44:04,250 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:44:04,250 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:44:04,250 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:44:04,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:44:04,251 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:44:04,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:44:04,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:44:04,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:44:04,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 06:44:04,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:44:04,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 06:44:04,264 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:44:04,264 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:44:04,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 06:44:04,264 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:44:04,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 06:44:04,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:44:04,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:44:04,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:04,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:44:04,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:44:04,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 06:44:04,266 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:44:04,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:44:04,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 06:44:04,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:44:04,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:44:04,267 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_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/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_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8 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 -> 2d8f12063511b3e3f39f22e34c8c81c8d42f35e2 [2021-10-13 06:44:04,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:44:04,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:44:04,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:44:04,554 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:44:04,554 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:44:04,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2021-10-13 06:44:04,648 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/data/dea3edca5/9d0bb1235f7d4149870723641493e37b/FLAG0abf97529 [2021-10-13 06:44:05,114 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:44:05,115 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2021-10-13 06:44:05,137 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/data/dea3edca5/9d0bb1235f7d4149870723641493e37b/FLAG0abf97529 [2021-10-13 06:44:05,489 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/data/dea3edca5/9d0bb1235f7d4149870723641493e37b [2021-10-13 06:44:05,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:44:05,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:44:05,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:05,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:44:05,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:44:05,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10673b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05, skipping insertion in model container [2021-10-13 06:44:05,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:44:05,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:44:05,689 WARN L228 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_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/sv-benchmarks/c/recursive-simple/sum_25x0-2.c[481,494] [2021-10-13 06:44:05,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:05,700 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:44:05,711 WARN L228 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_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/sv-benchmarks/c/recursive-simple/sum_25x0-2.c[481,494] [2021-10-13 06:44:05,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:05,725 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:44:05,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05 WrapperNode [2021-10-13 06:44:05,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:05,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:05,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:44:05,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:44:05,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:05,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:44:05,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:44:05,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:44:05,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:44:05,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:44:05,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:44:05,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:44:05,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (1/1) ... [2021-10-13 06:44:05,790 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:05,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:44:05,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:44:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:44:05,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:44:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-10-13 06:44:05,874 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-10-13 06:44:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:44:05,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:44:06,135 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:44:06,135 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-13 06:44:06,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:06 BoogieIcfgContainer [2021-10-13 06:44:06,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:44:06,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:44:06,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:44:06,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:44:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:44:05" (1/3) ... [2021-10-13 06:44:06,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b9ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:06, skipping insertion in model container [2021-10-13 06:44:06,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:05" (2/3) ... [2021-10-13 06:44:06,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b9ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:06, skipping insertion in model container [2021-10-13 06:44:06,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:06" (3/3) ... [2021-10-13 06:44:06,148 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2021-10-13 06:44:06,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:44:06,154 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 06:44:06,202 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:44:06,209 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 06:44:06,209 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 06:44:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-13 06:44:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 06:44:06,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:06,232 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:06,232 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2021-10-13 06:44:06,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:06,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333909517] [2021-10-13 06:44:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:06,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:06,440 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-13 06:44:06,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:06,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333909517] [2021-10-13 06:44:06,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333909517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:06,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:06,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:06,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267902957] [2021-10-13 06:44:06,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:06,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:06,466 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 06:44:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:06,566 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-10-13 06:44:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:06,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-10-13 06:44:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:06,576 INFO L225 Difference]: With dead ends: 22 [2021-10-13 06:44:06,577 INFO L226 Difference]: Without dead ends: 14 [2021-10-13 06:44:06,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-10-13 06:44:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-13 06:44:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-10-13 06:44:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-10-13 06:44:06,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-10-13 06:44:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:06,668 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-10-13 06:44:06,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 06:44:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-10-13 06:44:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 06:44:06,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:06,671 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:06,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:44:06,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2021-10-13 06:44:06,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:06,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930484529] [2021-10-13 06:44:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:06,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:06,813 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-13 06:44:06,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:06,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930484529] [2021-10-13 06:44:06,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930484529] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:06,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109833506] [2021-10-13 06:44:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:06,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:06,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:06,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 06:44:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 06:44:06,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:06,996 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-13 06:44:06,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:07,292 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-13 06:44:07,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109833506] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:07,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2125631244] [2021-10-13 06:44:07,328 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:07,328 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:07,338 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:07,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:07,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-13 06:44:07,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667233086] [2021-10-13 06:44:07,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 06:44:07,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 06:44:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:44:07,350 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-10-13 06:44:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:07,418 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-10-13 06:44:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2021-10-13 06:44:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:07,422 INFO L225 Difference]: With dead ends: 21 [2021-10-13 06:44:07,425 INFO L226 Difference]: Without dead ends: 17 [2021-10-13 06:44:07,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-13 06:44:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-13 06:44:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-13 06:44:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-13 06:44:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-10-13 06:44:07,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-10-13 06:44:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:07,442 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-13 06:44:07,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-10-13 06:44:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-10-13 06:44:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:44:07,446 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:07,446 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:07,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:07,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:07,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2021-10-13 06:44:07,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:07,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846495623] [2021-10-13 06:44:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:07,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:07,800 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-13 06:44:07,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:07,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846495623] [2021-10-13 06:44:07,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846495623] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:07,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619602212] [2021-10-13 06:44:07,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:44:07,803 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:07,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:07,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 06:44:07,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-13 06:44:07,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:07,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 06:44:07,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:07,962 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-13 06:44:07,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:08,352 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-13 06:44:08,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619602212] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:08,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658280680] [2021-10-13 06:44:08,360 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:08,361 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:08,361 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:08,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:08,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-13 06:44:08,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477149348] [2021-10-13 06:44:08,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 06:44:08,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:08,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 06:44:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-13 06:44:08,367 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-13 06:44:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:08,443 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-10-13 06:44:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:44:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2021-10-13 06:44:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:08,445 INFO L225 Difference]: With dead ends: 24 [2021-10-13 06:44:08,445 INFO L226 Difference]: Without dead ends: 20 [2021-10-13 06:44:08,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-13 06:44:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-13 06:44:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-13 06:44:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-13 06:44:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-13 06:44:08,458 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2021-10-13 06:44:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:08,458 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-13 06:44:08,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-13 06:44:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-13 06:44:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 06:44:08,462 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:08,462 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:08,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-13 06:44:08,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-13 06:44:08,680 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2021-10-13 06:44:08,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:08,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401528433] [2021-10-13 06:44:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:08,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:08,803 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-13 06:44:08,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:08,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401528433] [2021-10-13 06:44:08,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401528433] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:08,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438817098] [2021-10-13 06:44:08,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:44:08,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:08,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:08,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 06:44:08,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:44:08,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:08,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 06:44:08,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:09,071 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-13 06:44:09,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:09,595 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-13 06:44:09,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438817098] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:09,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [15490851] [2021-10-13 06:44:09,598 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:09,599 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:09,599 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:09,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:09,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-13 06:44:09,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493757978] [2021-10-13 06:44:09,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 06:44:09,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 06:44:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-13 06:44:09,602 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2021-10-13 06:44:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:09,675 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-10-13 06:44:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:09,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 27 [2021-10-13 06:44:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:09,677 INFO L225 Difference]: With dead ends: 27 [2021-10-13 06:44:09,677 INFO L226 Difference]: Without dead ends: 23 [2021-10-13 06:44:09,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 114.8ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-13 06:44:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-10-13 06:44:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-10-13 06:44:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-13 06:44:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-10-13 06:44:09,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2021-10-13 06:44:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:09,683 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-13 06:44:09,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2021-10-13 06:44:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-10-13 06:44:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 06:44:09,685 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:09,685 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:09,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:09,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:09,886 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:09,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2021-10-13 06:44:09,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:09,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865008612] [2021-10-13 06:44:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:09,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:10,004 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-13 06:44:10,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:10,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865008612] [2021-10-13 06:44:10,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865008612] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:10,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091906558] [2021-10-13 06:44:10,010 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:44:10,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:10,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:10,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 06:44:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:10,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-13 06:44:10,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:10,229 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-13 06:44:10,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:10,972 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-13 06:44:10,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091906558] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:10,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309998699] [2021-10-13 06:44:10,975 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:10,975 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:10,976 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:10,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:10,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2021-10-13 06:44:10,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382651639] [2021-10-13 06:44:10,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 06:44:10,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 06:44:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-13 06:44:10,979 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-10-13 06:44:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:11,074 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-10-13 06:44:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 06:44:11,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2021-10-13 06:44:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:11,076 INFO L225 Difference]: With dead ends: 30 [2021-10-13 06:44:11,076 INFO L226 Difference]: Without dead ends: 26 [2021-10-13 06:44:11,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 130.7ms TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-10-13 06:44:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-13 06:44:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-13 06:44:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-13 06:44:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-10-13 06:44:11,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2021-10-13 06:44:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:11,091 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-10-13 06:44:11,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-10-13 06:44:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-10-13 06:44:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 06:44:11,094 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:11,094 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:11,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:11,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:11,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2021-10-13 06:44:11,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:11,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873749267] [2021-10-13 06:44:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:11,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:11,439 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-13 06:44:11,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:11,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873749267] [2021-10-13 06:44:11,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873749267] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:11,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717577030] [2021-10-13 06:44:11,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:44:11,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:11,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:11,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:11,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 06:44:11,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-13 06:44:11,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:11,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 06:44:11,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:11,718 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-13 06:44:11,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:12,845 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-13 06:44:12,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717577030] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:12,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756816057] [2021-10-13 06:44:12,848 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:12,848 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:12,848 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:12,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:12,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2021-10-13 06:44:12,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95762852] [2021-10-13 06:44:12,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-13 06:44:12,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-13 06:44:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-13 06:44:12,852 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2021-10-13 06:44:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:12,970 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2021-10-13 06:44:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 06:44:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2021-10-13 06:44:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:12,973 INFO L225 Difference]: With dead ends: 33 [2021-10-13 06:44:12,973 INFO L226 Difference]: Without dead ends: 29 [2021-10-13 06:44:12,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 158.1ms TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-10-13 06:44:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-10-13 06:44:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-10-13 06:44:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2021-10-13 06:44:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-10-13 06:44:12,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2021-10-13 06:44:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:12,986 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-10-13 06:44:12,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2021-10-13 06:44:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-10-13 06:44:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 06:44:12,990 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:12,990 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:13,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:13,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:13,212 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2021-10-13 06:44:13,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:13,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432405229] [2021-10-13 06:44:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:13,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:13,361 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-13 06:44:13,361 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:13,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432405229] [2021-10-13 06:44:13,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432405229] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:13,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170794578] [2021-10-13 06:44:13,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:44:13,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:13,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:13,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 06:44:13,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:44:13,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:13,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 06:44:13,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:13,725 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-13 06:44:13,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:15,240 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-13 06:44:15,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170794578] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:15,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1366989712] [2021-10-13 06:44:15,242 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:15,242 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:15,243 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:15,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:15,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2021-10-13 06:44:15,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942919414] [2021-10-13 06:44:15,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 06:44:15,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 06:44:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-13 06:44:15,245 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2021-10-13 06:44:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:15,370 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-10-13 06:44:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 06:44:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 45 [2021-10-13 06:44:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:15,372 INFO L225 Difference]: With dead ends: 36 [2021-10-13 06:44:15,372 INFO L226 Difference]: Without dead ends: 32 [2021-10-13 06:44:15,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-10-13 06:44:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-13 06:44:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-13 06:44:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-13 06:44:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-13 06:44:15,378 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2021-10-13 06:44:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:15,378 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-13 06:44:15,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2021-10-13 06:44:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-13 06:44:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 06:44:15,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:15,380 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:15,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:15,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:15,584 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2021-10-13 06:44:15,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:15,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596520503] [2021-10-13 06:44:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:15,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:15,704 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-13 06:44:15,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:15,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596520503] [2021-10-13 06:44:15,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596520503] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:15,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070715079] [2021-10-13 06:44:15,705 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:44:15,706 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:15,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:15,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 06:44:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:15,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-13 06:44:15,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:16,115 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-13 06:44:16,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:18,078 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-13 06:44:18,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070715079] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:18,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59253350] [2021-10-13 06:44:18,089 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:18,089 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:18,090 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:18,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:18,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2021-10-13 06:44:18,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181585975] [2021-10-13 06:44:18,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-13 06:44:18,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-13 06:44:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-10-13 06:44:18,093 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2021-10-13 06:44:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:18,223 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-10-13 06:44:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 06:44:18,224 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 51 [2021-10-13 06:44:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:18,225 INFO L225 Difference]: With dead ends: 39 [2021-10-13 06:44:18,225 INFO L226 Difference]: Without dead ends: 35 [2021-10-13 06:44:18,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 219.2ms TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2021-10-13 06:44:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-13 06:44:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-13 06:44:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-13 06:44:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-10-13 06:44:18,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2021-10-13 06:44:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:18,232 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-10-13 06:44:18,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2021-10-13 06:44:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-10-13 06:44:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 06:44:18,234 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:18,234 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:18,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:18,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-10-13 06:44:18,460 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2021-10-13 06:44:18,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:18,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749759814] [2021-10-13 06:44:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:18,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:18,599 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-13 06:44:18,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:18,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749759814] [2021-10-13 06:44:18,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749759814] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:18,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454298513] [2021-10-13 06:44:18,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:44:18,600 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:18,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:18,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 06:44:18,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-10-13 06:44:18,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:18,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2021-10-13 06:44:18,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:19,418 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-13 06:44:19,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:24,621 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-13 06:44:24,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454298513] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:24,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1507653312] [2021-10-13 06:44:24,629 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:24,629 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:24,630 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:24,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:24,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 36 [2021-10-13 06:44:24,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723043991] [2021-10-13 06:44:24,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-10-13 06:44:24,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-13 06:44:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 06:44:24,634 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) [2021-10-13 06:44:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,121 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-10-13 06:44:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 06:44:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) Word has length 57 [2021-10-13 06:44:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,124 INFO L225 Difference]: With dead ends: 42 [2021-10-13 06:44:25,124 INFO L226 Difference]: Without dead ends: 38 [2021-10-13 06:44:25,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 735.4ms TimeCoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 [2021-10-13 06:44:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-13 06:44:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-13 06:44:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2021-10-13 06:44:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-13 06:44:25,132 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2021-10-13 06:44:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,132 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-13 06:44:25,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 25 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 18 states have return successors, (19), 19 states have call predecessors, (19), 4 states have call successors, (19) [2021-10-13 06:44:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-13 06:44:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 06:44:25,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,135 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:25,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-13 06:44:25,343 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2021-10-13 06:44:25,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498042933] [2021-10-13 06:44:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:25,557 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-13 06:44:25,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:25,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498042933] [2021-10-13 06:44:25,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498042933] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:25,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067761110] [2021-10-13 06:44:25,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:44:25,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:25,559 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:25,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 06:44:25,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:44:25,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:25,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-13 06:44:25,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:26,121 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-13 06:44:26,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:29,522 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-13 06:44:29,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067761110] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:29,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968066512] [2021-10-13 06:44:29,524 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:29,524 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:29,524 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:29,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:29,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2021-10-13 06:44:29,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270826101] [2021-10-13 06:44:29,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 06:44:29,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 06:44:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-10-13 06:44:29,527 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2021-10-13 06:44:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:29,717 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-10-13 06:44:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 06:44:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) Word has length 63 [2021-10-13 06:44:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:29,718 INFO L225 Difference]: With dead ends: 45 [2021-10-13 06:44:29,718 INFO L226 Difference]: Without dead ends: 41 [2021-10-13 06:44:29,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 302.8ms TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 06:44:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-10-13 06:44:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-10-13 06:44:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-13 06:44:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-10-13 06:44:29,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2021-10-13 06:44:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:29,725 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-10-13 06:44:29,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2021-10-13 06:44:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-10-13 06:44:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-13 06:44:29,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:29,727 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:29,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:29,927 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2021-10-13 06:44:29,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025376519] [2021-10-13 06:44:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,124 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-13 06:44:30,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:30,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025376519] [2021-10-13 06:44:30,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025376519] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:30,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739827884] [2021-10-13 06:44:30,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:44:30,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:30,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:30,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 06:44:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2021-10-13 06:44:30,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:30,789 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-13 06:44:30,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-13 06:44:34,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739827884] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:34,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [731638280] [2021-10-13 06:44:34,793 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:34,793 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:34,793 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:34,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:34,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2021-10-13 06:44:34,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311906466] [2021-10-13 06:44:34,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-13 06:44:34,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-13 06:44:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2021-10-13 06:44:34,797 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-10-13 06:44:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:35,003 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-10-13 06:44:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 06:44:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 69 [2021-10-13 06:44:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:35,005 INFO L225 Difference]: With dead ends: 48 [2021-10-13 06:44:35,005 INFO L226 Difference]: Without dead ends: 44 [2021-10-13 06:44:35,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 302.4ms TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2021-10-13 06:44:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-13 06:44:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-10-13 06:44:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-13 06:44:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-10-13 06:44:35,011 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2021-10-13 06:44:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:35,012 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-10-13 06:44:35,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-10-13 06:44:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-10-13 06:44:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-13 06:44:35,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:35,014 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:35,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:35,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-13 06:44:35,214 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2021-10-13 06:44:35,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:35,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510539286] [2021-10-13 06:44:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:35,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-10-13 06:44:35,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:35,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510539286] [2021-10-13 06:44:35,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510539286] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:35,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289845976] [2021-10-13 06:44:35,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:44:35,436 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:35,441 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:35,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 06:44:36,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-10-13 06:44:36,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:36,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-13 06:44:36,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-10-13 06:44:36,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-10-13 06:44:40,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289845976] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:40,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [544109718] [2021-10-13 06:44:40,948 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:40,948 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:40,948 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:40,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:40,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2021-10-13 06:44:40,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676545966] [2021-10-13 06:44:40,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-13 06:44:40,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-13 06:44:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-10-13 06:44:40,951 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2021-10-13 06:44:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:41,163 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2021-10-13 06:44:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 06:44:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) Word has length 75 [2021-10-13 06:44:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:41,164 INFO L225 Difference]: With dead ends: 51 [2021-10-13 06:44:41,164 INFO L226 Difference]: Without dead ends: 47 [2021-10-13 06:44:41,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 411.9ms TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2021-10-13 06:44:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-10-13 06:44:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-10-13 06:44:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-13 06:44:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-10-13 06:44:41,172 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2021-10-13 06:44:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:41,172 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-10-13 06:44:41,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (24), 12 states have call predecessors, (24), 14 states have call successors, (24) [2021-10-13 06:44:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-10-13 06:44:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-13 06:44:41,174 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:41,174 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:41,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:41,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-13 06:44:41,384 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2021-10-13 06:44:41,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:41,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705273462] [2021-10-13 06:44:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:41,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-10-13 06:44:41,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:41,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705273462] [2021-10-13 06:44:41,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705273462] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:41,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9955549] [2021-10-13 06:44:41,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:44:41,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:41,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:41,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 06:44:42,398 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:44:42,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:42,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-13 06:44:42,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-10-13 06:44:42,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-10-13 06:44:48,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9955549] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:48,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1336635974] [2021-10-13 06:44:48,485 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:48,485 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:48,486 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:48,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:48,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2021-10-13 06:44:48,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75979180] [2021-10-13 06:44:48,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-13 06:44:48,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-13 06:44:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2021-10-13 06:44:48,489 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-10-13 06:44:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:48,707 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-10-13 06:44:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 06:44:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 81 [2021-10-13 06:44:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:48,709 INFO L225 Difference]: With dead ends: 54 [2021-10-13 06:44:48,709 INFO L226 Difference]: Without dead ends: 50 [2021-10-13 06:44:48,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 417.3ms TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2021-10-13 06:44:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-13 06:44:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-10-13 06:44:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-13 06:44:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-10-13 06:44:48,716 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2021-10-13 06:44:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:48,716 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-10-13 06:44:48,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-10-13 06:44:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2021-10-13 06:44:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-13 06:44:48,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:48,718 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:48,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:48,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:48,924 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2021-10-13 06:44:48,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:48,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607045014] [2021-10-13 06:44:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:48,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-10-13 06:44:49,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:49,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607045014] [2021-10-13 06:44:49,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607045014] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:49,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546878565] [2021-10-13 06:44:49,129 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:44:49,130 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:49,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:49,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-13 06:44:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:49,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-13 06:44:49,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-10-13 06:44:50,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-10-13 06:44:57,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546878565] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:57,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475591515] [2021-10-13 06:44:57,783 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:44:57,784 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:57,784 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:44:57,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:44:57,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2021-10-13 06:44:57,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467636956] [2021-10-13 06:44:57,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-10-13 06:44:57,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-10-13 06:44:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2021-10-13 06:44:57,788 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2021-10-13 06:44:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:58,005 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-10-13 06:44:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-13 06:44:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) Word has length 87 [2021-10-13 06:44:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:58,007 INFO L225 Difference]: With dead ends: 57 [2021-10-13 06:44:58,007 INFO L226 Difference]: Without dead ends: 53 [2021-10-13 06:44:58,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 450.7ms TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2021-10-13 06:44:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-13 06:44:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-10-13 06:44:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2021-10-13 06:44:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-10-13 06:44:58,013 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2021-10-13 06:44:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:58,014 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-10-13 06:44:58,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2021-10-13 06:44:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-10-13 06:44:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 06:44:58,016 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:58,016 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:58,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:58,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-13 06:44:58,220 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2021-10-13 06:44:58,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:58,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590563540] [2021-10-13 06:44:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:58,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-10-13 06:44:58,461 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:58,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590563540] [2021-10-13 06:44:58,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590563540] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:58,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595312733] [2021-10-13 06:44:58,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:44:58,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:58,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:58,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-13 06:44:59,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-10-13 06:44:59,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:59,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 32 conjunts are in the unsatisfiable core [2021-10-13 06:44:59,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-10-13 06:44:59,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-10-13 06:45:08,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595312733] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:45:08,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589649925] [2021-10-13 06:45:08,870 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:45:08,870 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:45:08,870 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:45:08,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:45:08,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2021-10-13 06:45:08,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114565352] [2021-10-13 06:45:08,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-10-13 06:45:08,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:45:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-13 06:45:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2021-10-13 06:45:08,876 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2021-10-13 06:45:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:09,199 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-10-13 06:45:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 06:45:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) Word has length 93 [2021-10-13 06:45:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:09,201 INFO L225 Difference]: With dead ends: 60 [2021-10-13 06:45:09,201 INFO L226 Difference]: Without dead ends: 56 [2021-10-13 06:45:09,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 559.2ms TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2021-10-13 06:45:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-13 06:45:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-10-13 06:45:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2021-10-13 06:45:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-10-13 06:45:09,207 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2021-10-13 06:45:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:09,208 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-10-13 06:45:09,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2021-10-13 06:45:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-10-13 06:45:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 06:45:09,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:09,215 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:09,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:09,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-13 06:45:09,415 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2021-10-13 06:45:09,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:45:09,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800411033] [2021-10-13 06:45:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:09,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:45:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-10-13 06:45:09,657 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:45:09,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800411033] [2021-10-13 06:45:09,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800411033] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:45:09,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815601849] [2021-10-13 06:45:09,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:45:09,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:45:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:45:09,664 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:45:09,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-13 06:45:10,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:45:10,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:45:10,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2021-10-13 06:45:10,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-10-13 06:45:11,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-10-13 06:45:21,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815601849] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:45:21,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429153627] [2021-10-13 06:45:21,952 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:45:21,952 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:45:21,952 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:45:21,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:45:21,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2021-10-13 06:45:21,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836824699] [2021-10-13 06:45:21,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-10-13 06:45:21,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:45:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-10-13 06:45:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2021-10-13 06:45:21,955 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2021-10-13 06:45:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:22,250 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2021-10-13 06:45:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 06:45:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) Word has length 99 [2021-10-13 06:45:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:22,251 INFO L225 Difference]: With dead ends: 63 [2021-10-13 06:45:22,251 INFO L226 Difference]: Without dead ends: 59 [2021-10-13 06:45:22,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 567.1ms TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2021-10-13 06:45:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-10-13 06:45:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-10-13 06:45:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2021-10-13 06:45:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-10-13 06:45:22,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2021-10-13 06:45:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:22,258 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-10-13 06:45:22,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2021-10-13 06:45:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-10-13 06:45:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-13 06:45:22,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:22,261 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:22,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:22,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-13 06:45:22,476 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1678126652, now seen corresponding path program 16 times [2021-10-13 06:45:22,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:45:22,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282401969] [2021-10-13 06:45:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:22,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:45:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-10-13 06:45:22,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:45:22,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282401969] [2021-10-13 06:45:22,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282401969] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:45:22,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443056063] [2021-10-13 06:45:22,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:45:22,842 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:45:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:45:22,843 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:45:22,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-13 06:45:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:24,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-13 06:45:24,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2021-10-13 06:45:24,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-10-13 06:45:37,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443056063] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:45:37,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826138411] [2021-10-13 06:45:37,861 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:45:37,861 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:45:37,861 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:45:37,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:45:37,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2021-10-13 06:45:37,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560791513] [2021-10-13 06:45:37,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-10-13 06:45:37,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:45:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-10-13 06:45:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2021-10-13 06:45:37,864 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2021-10-13 06:45:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:38,213 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-10-13 06:45:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 06:45:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) Word has length 105 [2021-10-13 06:45:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:38,215 INFO L225 Difference]: With dead ends: 66 [2021-10-13 06:45:38,215 INFO L226 Difference]: Without dead ends: 62 [2021-10-13 06:45:38,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 638.2ms TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2021-10-13 06:45:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-13 06:45:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-13 06:45:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2021-10-13 06:45:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-10-13 06:45:38,222 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2021-10-13 06:45:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:38,222 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-10-13 06:45:38,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2021-10-13 06:45:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-10-13 06:45:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-10-13 06:45:38,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:38,224 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:38,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:38,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-13 06:45:38,444 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -543729842, now seen corresponding path program 17 times [2021-10-13 06:45:38,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:45:38,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722204875] [2021-10-13 06:45:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:38,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:45:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-10-13 06:45:38,765 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:45:38,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722204875] [2021-10-13 06:45:38,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722204875] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:45:38,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480287922] [2021-10-13 06:45:38,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:45:38,766 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:45:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:45:38,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:45:38,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-13 06:45:40,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2021-10-13 06:45:40,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:45:40,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 38 conjunts are in the unsatisfiable core [2021-10-13 06:45:40,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-10-13 06:45:40,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-10-13 06:45:56,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480287922] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:45:56,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111179427] [2021-10-13 06:45:56,427 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:45:56,427 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:45:56,428 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:45:56,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:45:56,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2021-10-13 06:45:56,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615381344] [2021-10-13 06:45:56,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-13 06:45:56,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:45:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-13 06:45:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2021-10-13 06:45:56,431 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2021-10-13 06:45:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:56,788 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2021-10-13 06:45:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 06:45:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) Word has length 111 [2021-10-13 06:45:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:56,789 INFO L225 Difference]: With dead ends: 69 [2021-10-13 06:45:56,790 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 06:45:56,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 679.0ms TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2021-10-13 06:45:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 06:45:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-13 06:45:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2021-10-13 06:45:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-10-13 06:45:56,796 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2021-10-13 06:45:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:56,797 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-10-13 06:45:56,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2021-10-13 06:45:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-10-13 06:45:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-13 06:45:56,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:56,798 INFO L512 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:56,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:57,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 06:45:57,008 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1011974276, now seen corresponding path program 18 times [2021-10-13 06:45:57,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:45:57,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960348711] [2021-10-13 06:45:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:57,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:45:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-10-13 06:45:57,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:45:57,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960348711] [2021-10-13 06:45:57,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960348711] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:45:57,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471253833] [2021-10-13 06:45:57,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:45:57,401 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:45:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:45:57,402 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:45:57,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-13 06:45:59,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:45:59,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:45:59,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 40 conjunts are in the unsatisfiable core [2021-10-13 06:45:59,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-10-13 06:45:59,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:46:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-10-13 06:46:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471253833] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:46:18,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92857131] [2021-10-13 06:46:18,302 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:46:18,303 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:46:18,303 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:46:18,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:46:18,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2021-10-13 06:46:18,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042124450] [2021-10-13 06:46:18,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-10-13 06:46:18,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:46:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-10-13 06:46:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2021-10-13 06:46:18,307 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2021-10-13 06:46:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:46:18,710 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2021-10-13 06:46:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 06:46:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) Word has length 117 [2021-10-13 06:46:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:46:18,712 INFO L225 Difference]: With dead ends: 72 [2021-10-13 06:46:18,712 INFO L226 Difference]: Without dead ends: 68 [2021-10-13 06:46:18,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 749.0ms TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2021-10-13 06:46:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-13 06:46:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-13 06:46:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2021-10-13 06:46:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-10-13 06:46:18,718 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2021-10-13 06:46:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:46:18,718 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-10-13 06:46:18,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2021-10-13 06:46:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-10-13 06:46:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-10-13 06:46:18,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:46:18,720 INFO L512 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:46:18,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-13 06:46:18,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:46:18,928 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:46:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:46:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 486282894, now seen corresponding path program 19 times [2021-10-13 06:46:18,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:46:18,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638178116] [2021-10-13 06:46:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:46:18,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:46:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:46:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-10-13 06:46:19,335 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:46:19,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638178116] [2021-10-13 06:46:19,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638178116] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:46:19,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171106428] [2021-10-13 06:46:19,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:46:19,336 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:46:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:46:19,344 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:46:19,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-10-13 06:46:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:46:21,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2021-10-13 06:46:21,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:46:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-10-13 06:46:22,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:46:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-10-13 06:46:43,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171106428] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:46:43,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138258831] [2021-10-13 06:46:43,996 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:46:43,997 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:46:43,997 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:46:43,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:46:43,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 45 [2021-10-13 06:46:43,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340313282] [2021-10-13 06:46:43,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-10-13 06:46:43,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:46:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-10-13 06:46:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=1472, Unknown=0, NotChecked=0, Total=1980 [2021-10-13 06:46:44,000 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2021-10-13 06:46:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:46:44,476 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2021-10-13 06:46:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-13 06:46:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) Word has length 123 [2021-10-13 06:46:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:46:44,478 INFO L225 Difference]: With dead ends: 75 [2021-10-13 06:46:44,478 INFO L226 Difference]: Without dead ends: 71 [2021-10-13 06:46:44,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 807.7ms TimeCoverageRelationStatistics Valid=1368, Invalid=2792, Unknown=0, NotChecked=0, Total=4160 [2021-10-13 06:46:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-13 06:46:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-13 06:46:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2021-10-13 06:46:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-10-13 06:46:44,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2021-10-13 06:46:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:46:44,483 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-10-13 06:46:44,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2021-10-13 06:46:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-10-13 06:46:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-13 06:46:44,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:46:44,485 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:46:44,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-10-13 06:46:44,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:46:44,685 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:46:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:46:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 20 times [2021-10-13 06:46:44,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:46:44,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817359929] [2021-10-13 06:46:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:46:44,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:46:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:46:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-10-13 06:46:45,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:46:45,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817359929] [2021-10-13 06:46:45,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817359929] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:46:45,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690156397] [2021-10-13 06:46:45,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:46:45,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:46:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:46:45,116 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:46:45,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-10-13 06:46:48,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2021-10-13 06:46:48,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:46:48,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 88 conjunts are in the unsatisfiable core [2021-10-13 06:46:48,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:46:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-10-13 06:46:49,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:47:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-10-13 06:47:59,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690156397] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:47:59,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307134793] [2021-10-13 06:47:59,674 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:47:59,674 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:47:59,674 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:47:59,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:47:59,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 47, 47] total 72 [2021-10-13 06:47:59,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177463018] [2021-10-13 06:47:59,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-10-13 06:47:59,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:47:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-10-13 06:47:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4354, Unknown=0, NotChecked=0, Total=5112 [2021-10-13 06:47:59,679 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 72 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 49 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 42 states have return successors, (43), 43 states have call predecessors, (43), 4 states have call successors, (43) [2021-10-13 06:48:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:48:01,121 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-10-13 06:48:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-13 06:48:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 49 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 42 states have return successors, (43), 43 states have call predecessors, (43), 4 states have call successors, (43) Word has length 129 [2021-10-13 06:48:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:48:01,122 INFO L225 Difference]: With dead ends: 78 [2021-10-13 06:48:01,123 INFO L226 Difference]: Without dead ends: 74 [2021-10-13 06:48:01,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2428 ImplicationChecksByTransitivity, 2536.3ms TimeCoverageRelationStatistics Valid=2249, Invalid=10633, Unknown=0, NotChecked=0, Total=12882 [2021-10-13 06:48:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-13 06:48:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-10-13 06:48:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2021-10-13 06:48:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2021-10-13 06:48:01,132 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2021-10-13 06:48:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:48:01,133 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2021-10-13 06:48:01,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 49 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 42 states have return successors, (43), 43 states have call predecessors, (43), 4 states have call successors, (43) [2021-10-13 06:48:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-10-13 06:48:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-10-13 06:48:01,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:48:01,135 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:48:01,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-10-13 06:48:01,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:48:01,344 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:48:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:48:01,345 INFO L82 PathProgramCache]: Analyzing trace with hash -92396082, now seen corresponding path program 21 times [2021-10-13 06:48:01,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:48:01,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179123491] [2021-10-13 06:48:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:48:01,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:48:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:48:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-10-13 06:48:01,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:48:01,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179123491] [2021-10-13 06:48:01,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179123491] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:48:01,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745032808] [2021-10-13 06:48:01,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:48:01,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:48:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:48:01,786 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:48:01,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-10-13 06:48:05,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:48:05,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:48:05,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 46 conjunts are in the unsatisfiable core [2021-10-13 06:48:05,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:48:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-10-13 06:48:05,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:48:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-10-13 06:48:35,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745032808] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:48:35,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842164875] [2021-10-13 06:48:35,333 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:48:35,333 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:48:35,333 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:48:35,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:48:35,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 47] total 49 [2021-10-13 06:48:35,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360266378] [2021-10-13 06:48:35,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-10-13 06:48:35,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:48:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-10-13 06:48:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2021-10-13 06:48:35,336 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) [2021-10-13 06:48:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:48:35,840 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2021-10-13 06:48:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-13 06:48:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) Word has length 135 [2021-10-13 06:48:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:48:35,841 INFO L225 Difference]: With dead ends: 81 [2021-10-13 06:48:35,842 INFO L226 Difference]: Without dead ends: 77 [2021-10-13 06:48:35,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 945.5ms TimeCoverageRelationStatistics Valid=1636, Invalid=3334, Unknown=0, NotChecked=0, Total=4970 [2021-10-13 06:48:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-13 06:48:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-10-13 06:48:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 2 states have call successors, (24) [2021-10-13 06:48:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-10-13 06:48:35,848 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2021-10-13 06:48:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:48:35,848 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-10-13 06:48:35,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) [2021-10-13 06:48:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-10-13 06:48:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-10-13 06:48:35,850 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:48:35,850 INFO L512 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:48:35,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-10-13 06:48:36,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-13 06:48:36,076 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:48:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:48:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1661997564, now seen corresponding path program 22 times [2021-10-13 06:48:36,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:48:36,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809479917] [2021-10-13 06:48:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:48:36,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:48:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:48:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2021-10-13 06:48:36,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:48:36,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809479917] [2021-10-13 06:48:36,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809479917] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:48:36,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743510031] [2021-10-13 06:48:36,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 06:48:36,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:48:36,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:48:36,536 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:48:36,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-10-13 06:48:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:48:40,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 48 conjunts are in the unsatisfiable core [2021-10-13 06:48:40,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:48:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2021-10-13 06:48:41,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:49:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-10-13 06:49:16,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743510031] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:49:16,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203160255] [2021-10-13 06:49:16,239 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:49:16,239 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:49:16,240 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:49:16,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:49:16,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 49] total 51 [2021-10-13 06:49:16,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672276470] [2021-10-13 06:49:16,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-10-13 06:49:16,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:49:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-10-13 06:49:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1898, Unknown=0, NotChecked=0, Total=2550 [2021-10-13 06:49:16,245 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2021-10-13 06:49:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:49:16,805 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2021-10-13 06:49:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-13 06:49:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) Word has length 141 [2021-10-13 06:49:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:49:16,807 INFO L225 Difference]: With dead ends: 84 [2021-10-13 06:49:16,807 INFO L226 Difference]: Without dead ends: 80 [2021-10-13 06:49:16,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1097.4ms TimeCoverageRelationStatistics Valid=1779, Invalid=3623, Unknown=0, NotChecked=0, Total=5402 [2021-10-13 06:49:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-13 06:49:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-10-13 06:49:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 54 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2021-10-13 06:49:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2021-10-13 06:49:16,811 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2021-10-13 06:49:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:49:16,812 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2021-10-13 06:49:16,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2021-10-13 06:49:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2021-10-13 06:49:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-13 06:49:16,815 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:49:16,815 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:49:16,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-10-13 06:49:17,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-13 06:49:17,024 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:49:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:49:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash 675382542, now seen corresponding path program 23 times [2021-10-13 06:49:17,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:49:17,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760644628] [2021-10-13 06:49:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:49:17,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:49:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:49:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-10-13 06:49:17,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:49:17,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760644628] [2021-10-13 06:49:17,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760644628] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:49:17,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094587125] [2021-10-13 06:49:17,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 06:49:17,526 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:49:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:49:17,527 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:49:17,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-10-13 06:49:22,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2021-10-13 06:49:22,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:49:22,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 50 conjunts are in the unsatisfiable core [2021-10-13 06:49:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:49:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-10-13 06:49:22,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:50:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-10-13 06:50:02,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094587125] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:50:02,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [594035067] [2021-10-13 06:50:02,587 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:50:02,587 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:50:02,587 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:50:02,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:50:02,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 51] total 53 [2021-10-13 06:50:02,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971693980] [2021-10-13 06:50:02,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-10-13 06:50:02,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:02,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-10-13 06:50:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=2052, Unknown=0, NotChecked=0, Total=2756 [2021-10-13 06:50:02,590 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) [2021-10-13 06:50:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:03,171 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2021-10-13 06:50:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-13 06:50:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) Word has length 147 [2021-10-13 06:50:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:03,173 INFO L225 Difference]: With dead ends: 87 [2021-10-13 06:50:03,173 INFO L226 Difference]: Without dead ends: 83 [2021-10-13 06:50:03,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1105.6ms TimeCoverageRelationStatistics Valid=1928, Invalid=3924, Unknown=0, NotChecked=0, Total=5852 [2021-10-13 06:50:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-10-13 06:50:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-10-13 06:50:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2021-10-13 06:50:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-10-13 06:50:03,178 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2021-10-13 06:50:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:03,179 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-10-13 06:50:03,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) [2021-10-13 06:50:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-10-13 06:50:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-13 06:50:03,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:03,181 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:03,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-10-13 06:50:03,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:50:03,396 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:50:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1206824132, now seen corresponding path program 24 times [2021-10-13 06:50:03,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:03,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511519515] [2021-10-13 06:50:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:03,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:50:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-10-13 06:50:03,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:50:03,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511519515] [2021-10-13 06:50:03,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511519515] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:50:03,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148216652] [2021-10-13 06:50:03,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 06:50:03,903 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:50:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:50:03,904 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:50:03,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-10-13 06:50:09,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 06:50:09,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:50:09,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 52 conjunts are in the unsatisfiable core [2021-10-13 06:50:09,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:50:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-10-13 06:50:09,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:50:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-10-13 06:50:55,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148216652] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:50:55,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [408207506] [2021-10-13 06:50:55,301 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-13 06:50:55,301 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:50:55,301 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-13 06:50:55,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-13 06:50:55,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 53] total 54 [2021-10-13 06:50:55,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637862757] [2021-10-13 06:50:55,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-10-13 06:50:55,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:50:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-10-13 06:50:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2021-10-13 06:50:55,304 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 54 states, 53 states have (on average 2.0) internal successors, (106), 53 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 25 states have return successors, (49), 25 states have call predecessors, (49), 26 states have call successors, (49) [2021-10-13 06:50:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:50:55,766 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2021-10-13 06:50:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-13 06:50:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.0) internal successors, (106), 53 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 25 states have return successors, (49), 25 states have call predecessors, (49), 26 states have call successors, (49) Word has length 153 [2021-10-13 06:50:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:50:55,768 INFO L225 Difference]: With dead ends: 90 [2021-10-13 06:50:55,768 INFO L226 Difference]: Without dead ends: 86 [2021-10-13 06:50:55,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1187.2ms TimeCoverageRelationStatistics Valid=2080, Invalid=4082, Unknown=0, NotChecked=0, Total=6162 [2021-10-13 06:50:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-10-13 06:50:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-10-13 06:50:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2021-10-13 06:50:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2021-10-13 06:50:55,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2021-10-13 06:50:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:50:55,775 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2021-10-13 06:50:55,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.0) internal successors, (106), 53 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 25 states have return successors, (49), 25 states have call predecessors, (49), 26 states have call successors, (49) [2021-10-13 06:50:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2021-10-13 06:50:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 06:50:55,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:50:55,778 INFO L512 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:50:55,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-10-13 06:50:56,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-10-13 06:50:56,004 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:50:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:50:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1687538610, now seen corresponding path program 25 times [2021-10-13 06:50:56,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:50:56,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137382391] [2021-10-13 06:50:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:50:56,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:50:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 06:50:56,146 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 06:50:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 06:50:56,336 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 06:50:56,336 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 06:50:56,337 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:50:56,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 06:50:56,348 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 06:50:56,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:50:56 BoogieIcfgContainer [2021-10-13 06:50:56,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 06:50:56,463 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 06:50:56,463 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 06:50:56,464 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 06:50:56,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:06" (3/4) ... [2021-10-13 06:50:56,466 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 06:50:56,578 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 06:50:56,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 06:50:56,580 INFO L168 Benchmark]: Toolchain (without parser) took 411084.54 ms. Allocated memory was 117.4 MB in the beginning and 1.1 GB in the end (delta: 968.9 MB). Free memory was 81.7 MB in the beginning and 216.3 MB in the end (delta: -134.6 MB). Peak memory consumption was 829.9 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,581 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 117.4 MB. Free memory was 88.6 MB in the beginning and 88.6 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:50:56,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.84 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 92.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 117.4 MB. Free memory was 92.2 MB in the beginning and 91.3 MB in the end (delta: 867.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,582 INFO L168 Benchmark]: Boogie Preprocessor took 18.74 ms. Allocated memory is still 117.4 MB. Free memory was 91.3 MB in the beginning and 90.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:50:56,583 INFO L168 Benchmark]: RCFGBuilder took 357.82 ms. Allocated memory is still 117.4 MB. Free memory was 90.1 MB in the beginning and 80.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,583 INFO L168 Benchmark]: TraceAbstraction took 410322.52 ms. Allocated memory was 117.4 MB in the beginning and 1.1 GB in the end (delta: 968.9 MB). Free memory was 79.6 MB in the beginning and 223.7 MB in the end (delta: -144.0 MB). Peak memory consumption was 822.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,584 INFO L168 Benchmark]: Witness Printer took 115.55 ms. Allocated memory is still 1.1 GB. Free memory was 223.7 MB in the beginning and 216.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:50:56,591 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.31 ms. Allocated memory is still 117.4 MB. Free memory was 88.6 MB in the beginning and 88.6 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 227.84 ms. Allocated memory is still 117.4 MB. Free memory was 81.5 MB in the beginning and 92.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 117.4 MB. Free memory was 92.2 MB in the beginning and 91.3 MB in the end (delta: 867.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.74 ms. Allocated memory is still 117.4 MB. Free memory was 91.3 MB in the beginning and 90.1 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 357.82 ms. Allocated memory is still 117.4 MB. Free memory was 90.1 MB in the beginning and 80.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 410322.52 ms. Allocated memory was 117.4 MB in the beginning and 1.1 GB in the end (delta: 968.9 MB). Free memory was 79.6 MB in the beginning and 223.7 MB in the end (delta: -144.0 MB). Peak memory consumption was 822.4 MB. Max. memory is 16.1 GB. * Witness Printer took 115.55 ms. Allocated memory is still 1.1 GB. Free memory was 223.7 MB in the beginning and 216.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 25; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 410143.6ms, OverallIterations: 26, TraceHistogramMax: 26, EmptinessCheckTime: 44.3ms, AutomataDifference: 8197.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 199 SDtfs, 6088 SDslu, 1895 SDs, 0 SdLazy, 2350 SolverSat, 2880 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2223.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5064 GetRequests, 3947 SyntacticMatches, 2 SemanticMatches, 1115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10231 ImplicationChecksByTransitivity, 14491.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 204.5ms AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 317.5ms SsaConstructionTime, 1526.8ms SatisfiabilityAnalysisTime, 358290.8ms InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 5984 ConstructedInterpolants, 0 QuantifiedInterpolants, 18216 SizeOfPredicates, 334 NumberOfNonLiveVariables, 6792 ConjunctsInSsa, 760 ConjunctsInUnsatCore, 73 InterpolantComputations, 1 PerfectInterpolantSequences, 18064/45000 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 incorrect! [2021-10-13 06:50:56,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bee8fc06-afbc-48e6-8506-ba4ed986fbf2/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...