./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh --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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 11:41:54,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:41:54,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:41:54,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:41:54,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:41:54,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:41:54,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:41:54,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:41:54,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:41:54,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:41:54,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:41:54,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:41:54,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:41:54,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:41:54,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:41:54,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:41:54,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:41:54,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:41:54,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:41:54,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:41:54,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:41:54,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:41:54,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:41:54,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:41:54,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:41:54,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:41:54,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:41:54,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:41:54,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:41:54,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:41:54,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:41:54,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:41:54,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:41:54,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:41:54,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:41:54,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:41:54,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:41:54,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:41:54,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:41:54,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:41:54,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:41:54,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:41:54,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:41:54,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:41:54,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:41:54,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:41:54,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:41:54,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:41:54,551 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:41:54,551 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:41:54,551 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:41:54,551 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:41:54,551 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:41:54,552 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:41:54,552 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:41:54,552 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:41:54,552 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:41:54,552 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:41:54,553 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:41:54,553 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:41:54,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:41:54,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:41:54,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:41:54,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:41:54,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:41:54,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:41:54,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:41:54,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:41:54,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:41:54,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:41:54,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:41:54,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:41:54,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/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_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2022-12-14 11:41:54,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:41:54,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:41:54,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:41:54,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:41:54,777 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:41:54,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/recursive/Primes.c [2022-12-14 11:41:57,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:41:57,573 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:41:57,574 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/sv-benchmarks/c/recursive/Primes.c [2022-12-14 11:41:57,579 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/data/8ff538fed/5941c025309348f0b3074f1b883e1b55/FLAG1d28f6ec9 [2022-12-14 11:41:57,590 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/data/8ff538fed/5941c025309348f0b3074f1b883e1b55 [2022-12-14 11:41:57,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:41:57,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:41:57,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:41:57,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:41:57,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:41:57,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2fe698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57, skipping insertion in model container [2022-12-14 11:41:57,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:41:57,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:41:57,732 WARN L237 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_bda7e2ec-baa7-474d-b1d0-ef69d018b190/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-12-14 11:41:57,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:41:57,742 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:41:57,756 WARN L237 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_bda7e2ec-baa7-474d-b1d0-ef69d018b190/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-12-14 11:41:57,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:41:57,767 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:41:57,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57 WrapperNode [2022-12-14 11:41:57,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:41:57,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:41:57,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:41:57,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:41:57,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,792 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-14 11:41:57,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:41:57,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:41:57,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:41:57,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:41:57,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,806 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:41:57,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:41:57,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:41:57,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:41:57,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (1/1) ... [2022-12-14 11:41:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:41:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:41:57,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:41:57,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:41:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2022-12-14 11:41:57,873 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2022-12-14 11:41:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:41:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-12-14 11:41:57,873 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-12-14 11:41:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2022-12-14 11:41:57,873 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2022-12-14 11:41:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:41:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:41:57,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:41:57,935 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:41:57,936 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:41:58,082 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:41:58,097 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:41:58,097 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 11:41:58,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:58 BoogieIcfgContainer [2022-12-14 11:41:58,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:41:58,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:41:58,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:41:58,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:41:58,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:41:57" (1/3) ... [2022-12-14 11:41:58,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d02b721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:41:58, skipping insertion in model container [2022-12-14 11:41:58,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:41:57" (2/3) ... [2022-12-14 11:41:58,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d02b721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:41:58, skipping insertion in model container [2022-12-14 11:41:58,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:58" (3/3) ... [2022-12-14 11:41:58,105 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2022-12-14 11:41:58,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:41:58,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:41:58,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:41:58,157 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1580c4fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:41:58,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:41:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 11:41:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:41:58,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:58,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:58,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1349448312, now seen corresponding path program 1 times [2022-12-14 11:41:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:58,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213507726] [2022-12-14 11:41:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:41:58,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:58,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213507726] [2022-12-14 11:41:58,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213507726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:41:58,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:41:58,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:41:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423633804] [2022-12-14 11:41:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:41:58,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:41:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:41:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:41:58,337 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:41:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:41:58,375 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2022-12-14 11:41:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:41:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-12-14 11:41:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:41:58,382 INFO L225 Difference]: With dead ends: 54 [2022-12-14 11:41:58,382 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 11:41:58,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:41:58,386 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:41:58,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:41:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 11:41:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 11:41:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 11:41:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-12-14 11:41:58,413 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2022-12-14 11:41:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:41:58,414 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-12-14 11:41:58,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-12-14 11:41:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-12-14 11:41:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:41:58,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:58,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:58,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:41:58,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1094481281, now seen corresponding path program 1 times [2022-12-14 11:41:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:58,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118057489] [2022-12-14 11:41:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:41:58,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:58,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118057489] [2022-12-14 11:41:58,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118057489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:41:58,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:41:58,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:41:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750407313] [2022-12-14 11:41:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:41:58,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:41:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:58,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:41:58,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:41:58,564 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:41:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:41:58,620 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-12-14 11:41:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:41:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 11:41:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:41:58,623 INFO L225 Difference]: With dead ends: 53 [2022-12-14 11:41:58,624 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 11:41:58,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:41:58,625 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:41:58,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:41:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 11:41:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-14 11:41:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 11:41:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2022-12-14 11:41:58,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 20 [2022-12-14 11:41:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:41:58,635 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2022-12-14 11:41:58,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:41:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-12-14 11:41:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:41:58,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:58,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:41:58,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 268966181, now seen corresponding path program 1 times [2022-12-14 11:41:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469303027] [2022-12-14 11:41:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:41:58,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:58,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469303027] [2022-12-14 11:41:58,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469303027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:41:58,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:41:58,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:41:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530555623] [2022-12-14 11:41:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:41:58,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:41:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:41:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:41:58,718 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:41:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:41:58,772 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-12-14 11:41:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:41:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-12-14 11:41:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:41:58,773 INFO L225 Difference]: With dead ends: 55 [2022-12-14 11:41:58,773 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 11:41:58,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:41:58,774 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:41:58,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:41:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 11:41:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-12-14 11:41:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 11:41:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2022-12-14 11:41:58,783 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 21 [2022-12-14 11:41:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:41:58,783 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2022-12-14 11:41:58,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:41:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-12-14 11:41:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:41:58,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:58,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:41:58,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 47098385, now seen corresponding path program 1 times [2022-12-14 11:41:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161011582] [2022-12-14 11:41:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 11:41:58,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:58,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161011582] [2022-12-14 11:41:58,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161011582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:41:58,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:41:58,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:41:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327433770] [2022-12-14 11:41:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:41:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:41:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:41:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:41:58,891 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:41:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:41:58,929 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-12-14 11:41:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:41:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-12-14 11:41:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:41:58,931 INFO L225 Difference]: With dead ends: 72 [2022-12-14 11:41:58,931 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 11:41:58,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:41:58,932 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:41:58,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 294 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:41:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 11:41:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 11:41:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-14 11:41:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-12-14 11:41:58,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2022-12-14 11:41:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:41:58,938 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-12-14 11:41:58,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:41:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-12-14 11:41:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 11:41:58,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:58,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:41:58,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1677803704, now seen corresponding path program 1 times [2022-12-14 11:41:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:58,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859776871] [2022-12-14 11:41:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:41:59,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:59,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859776871] [2022-12-14 11:41:59,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859776871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:41:59,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648871945] [2022-12-14 11:41:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:41:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:41:59,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:41:59,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:41:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:59,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:41:59,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:41:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 11:41:59,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:41:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:41:59,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648871945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:41:59,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273462993] [2022-12-14 11:41:59,308 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 11:41:59,308 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:41:59,313 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:41:59,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:41:59,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-12-14 11:41:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229754174] [2022-12-14 11:41:59,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:41:59,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 11:41:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 11:41:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:41:59,316 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 11:41:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:41:59,417 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2022-12-14 11:41:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:41:59,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-12-14 11:41:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:41:59,418 INFO L225 Difference]: With dead ends: 66 [2022-12-14 11:41:59,418 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 11:41:59,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-12-14 11:41:59,420 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:41:59,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:41:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 11:41:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-14 11:41:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 11:41:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-12-14 11:41:59,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2022-12-14 11:41:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:41:59,427 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-12-14 11:41:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 11:41:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-12-14 11:41:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:41:59,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:41:59,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:41:59,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:41:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:41:59,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:41:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:41:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1617599152, now seen corresponding path program 1 times [2022-12-14 11:41:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:41:59,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803866259] [2022-12-14 11:41:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:41:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:41:59,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:41:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803866259] [2022-12-14 11:41:59,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803866259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:41:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087433326] [2022-12-14 11:41:59,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:41:59,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:41:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:41:59,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:41:59,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:41:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:41:59,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 11:41:59,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:42:00,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:42:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:42:00,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087433326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:42:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367175586] [2022-12-14 11:42:00,304 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 11:42:00,304 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:42:00,304 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:42:00,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:42:00,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-12-14 11:42:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200901192] [2022-12-14 11:42:00,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:42:00,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 11:42:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 11:42:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-12-14 11:42:00,308 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 11:42:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:00,551 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-12-14 11:42:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 11:42:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2022-12-14 11:42:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:00,552 INFO L225 Difference]: With dead ends: 68 [2022-12-14 11:42:00,552 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 11:42:00,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2022-12-14 11:42:00,554 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:00,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 461 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 11:42:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-12-14 11:42:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 11:42:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-12-14 11:42:00,559 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2022-12-14 11:42:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:00,559 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-12-14 11:42:00,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 11:42:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-12-14 11:42:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:42:00,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:00,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:00,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:42:00,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:00,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1287840268, now seen corresponding path program 1 times [2022-12-14 11:42:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:00,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083657458] [2022-12-14 11:42:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:42:00,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083657458] [2022-12-14 11:42:00,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083657458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:00,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:42:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311497320] [2022-12-14 11:42:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:42:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:42:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:00,974 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:42:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:01,011 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-12-14 11:42:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:42:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-12-14 11:42:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:01,013 INFO L225 Difference]: With dead ends: 70 [2022-12-14 11:42:01,013 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 11:42:01,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:42:01,014 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:01,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 11:42:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-12-14 11:42:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 11:42:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-12-14 11:42:01,021 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2022-12-14 11:42:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:01,021 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-12-14 11:42:01,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:42:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-12-14 11:42:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 11:42:01,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:01,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:01,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:42:01,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1285376925, now seen corresponding path program 1 times [2022-12-14 11:42:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:01,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662175801] [2022-12-14 11:42:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:42:01,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:01,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662175801] [2022-12-14 11:42:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662175801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:01,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:01,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:42:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854823679] [2022-12-14 11:42:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:42:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:42:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:42:01,062 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:42:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:01,081 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2022-12-14 11:42:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:42:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-12-14 11:42:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:01,082 INFO L225 Difference]: With dead ends: 99 [2022-12-14 11:42:01,082 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 11:42:01,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:42:01,084 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:01,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 11:42:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-14 11:42:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2022-12-14 11:42:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-12-14 11:42:01,091 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-12-14 11:42:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:01,091 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-12-14 11:42:01,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:42:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-12-14 11:42:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 11:42:01,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:01,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:01,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:42:01,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash -68737779, now seen corresponding path program 1 times [2022-12-14 11:42:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427606701] [2022-12-14 11:42:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:42:01,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427606701] [2022-12-14 11:42:01,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427606701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:42:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283009318] [2022-12-14 11:42:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:01,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:42:01,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:42:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:42:01,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:42:01,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:42:01,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283009318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:01,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:42:01,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-14 11:42:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678712455] [2022-12-14 11:42:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:01,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:42:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:42:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:42:01,213 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 11:42:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:01,251 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2022-12-14 11:42:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:42:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2022-12-14 11:42:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:01,253 INFO L225 Difference]: With dead ends: 106 [2022-12-14 11:42:01,253 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 11:42:01,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:01,254 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:01,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 11:42:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-14 11:42:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2022-12-14 11:42:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-12-14 11:42:01,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 51 [2022-12-14 11:42:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:01,261 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-12-14 11:42:01,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 11:42:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-12-14 11:42:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 11:42:01,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:01,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:01,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:42:01,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:01,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1129977969, now seen corresponding path program 1 times [2022-12-14 11:42:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:01,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997385793] [2022-12-14 11:42:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 11:42:01,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997385793] [2022-12-14 11:42:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997385793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:01,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:42:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465072530] [2022-12-14 11:42:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:42:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:42:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:01,567 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 11:42:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:01,594 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2022-12-14 11:42:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:42:01,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-12-14 11:42:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:01,596 INFO L225 Difference]: With dead ends: 114 [2022-12-14 11:42:01,596 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 11:42:01,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:01,597 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:01,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 11:42:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-12-14 11:42:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 11 states have call predecessors, (17), 8 states have call successors, (17) [2022-12-14 11:42:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2022-12-14 11:42:01,603 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 56 [2022-12-14 11:42:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:01,603 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2022-12-14 11:42:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 11:42:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-12-14 11:42:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 11:42:01,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:01,604 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:01,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:42:01,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1501667645, now seen corresponding path program 1 times [2022-12-14 11:42:01,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:01,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606643291] [2022-12-14 11:42:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 11:42:01,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:01,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606643291] [2022-12-14 11:42:01,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606643291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:01,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:01,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:42:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844276816] [2022-12-14 11:42:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:01,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:42:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:42:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:42:01,669 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:42:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:01,694 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2022-12-14 11:42:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:42:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-14 11:42:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:01,696 INFO L225 Difference]: With dead ends: 117 [2022-12-14 11:42:01,696 INFO L226 Difference]: Without dead ends: 63 [2022-12-14 11:42:01,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:42:01,697 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:01,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-14 11:42:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-12-14 11:42:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2022-12-14 11:42:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-12-14 11:42:01,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 65 [2022-12-14 11:42:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:01,701 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-12-14 11:42:01,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:42:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-12-14 11:42:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 11:42:01,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:01,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:01,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:42:01,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2075972807, now seen corresponding path program 1 times [2022-12-14 11:42:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588431793] [2022-12-14 11:42:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 11:42:01,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:01,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588431793] [2022-12-14 11:42:01,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588431793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:42:01,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671277245] [2022-12-14 11:42:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:01,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:42:01,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:42:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:01,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:42:01,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 11:42:01,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:42:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 11:42:01,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671277245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:42:01,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [846809996] [2022-12-14 11:42:01,993 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-12-14 11:42:01,993 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:42:01,994 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:42:01,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:42:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-14 11:42:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539348328] [2022-12-14 11:42:01,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:42:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:42:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:42:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:01,996 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-14 11:42:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:02,047 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2022-12-14 11:42:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:42:02,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) Word has length 66 [2022-12-14 11:42:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:02,048 INFO L225 Difference]: With dead ends: 124 [2022-12-14 11:42:02,048 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 11:42:02,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:42:02,050 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:02,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 162 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 11:42:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-12-14 11:42:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-12-14 11:42:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-12-14 11:42:02,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 66 [2022-12-14 11:42:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:02,055 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-12-14 11:42:02,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-14 11:42:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-12-14 11:42:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 11:42:02,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:02,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:02,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:42:02,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:02,257 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1627957863, now seen corresponding path program 1 times [2022-12-14 11:42:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132418217] [2022-12-14 11:42:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:42:02,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:02,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132418217] [2022-12-14 11:42:02,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132418217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:02,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:02,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:42:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850979559] [2022-12-14 11:42:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:42:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:42:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:42:02,365 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:42:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:02,391 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2022-12-14 11:42:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:42:02,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-12-14 11:42:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:02,392 INFO L225 Difference]: With dead ends: 113 [2022-12-14 11:42:02,392 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 11:42:02,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:42:02,393 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:02,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 11:42:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-12-14 11:42:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16) [2022-12-14 11:42:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-12-14 11:42:02,399 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 66 [2022-12-14 11:42:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:02,400 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-12-14 11:42:02,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:42:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-12-14 11:42:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 11:42:02,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:02,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:02,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:42:02,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1340831987, now seen corresponding path program 1 times [2022-12-14 11:42:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:02,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949943656] [2022-12-14 11:42:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:42:02,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:02,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949943656] [2022-12-14 11:42:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949943656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:42:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157219215] [2022-12-14 11:42:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:02,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:02,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:02,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:42:02,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:42:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:02,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 11:42:02,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:42:02,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:42:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:42:02,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157219215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:42:02,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559904151] [2022-12-14 11:42:02,876 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2022-12-14 11:42:02,876 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:42:02,877 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:42:02,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:42:02,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-12-14 11:42:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261907243] [2022-12-14 11:42:02,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:42:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:42:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:42:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:42:02,878 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-14 11:42:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:02,998 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2022-12-14 11:42:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:42:02,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) Word has length 60 [2022-12-14 11:42:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:03,000 INFO L225 Difference]: With dead ends: 92 [2022-12-14 11:42:03,000 INFO L226 Difference]: Without dead ends: 63 [2022-12-14 11:42:03,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-12-14 11:42:03,001 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:03,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 267 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-14 11:42:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-14 11:42:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 10 states have return successors, (20), 12 states have call predecessors, (20), 7 states have call successors, (20) [2022-12-14 11:42:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2022-12-14 11:42:03,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 60 [2022-12-14 11:42:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:03,008 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2022-12-14 11:42:03,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-14 11:42:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-12-14 11:42:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 11:42:03,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:03,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:03,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:42:03,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:03,210 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:03,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2129490437, now seen corresponding path program 2 times [2022-12-14 11:42:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:03,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193972408] [2022-12-14 11:42:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:42:03,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193972408] [2022-12-14 11:42:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193972408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:42:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335027816] [2022-12-14 11:42:03,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:42:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:03,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:42:03,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:42:03,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 11:42:03,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:42:03,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 11:42:03,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 11:42:03,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:42:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:42:04,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335027816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:42:04,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1698244881] [2022-12-14 11:42:04,047 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2022-12-14 11:42:04,047 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:42:04,048 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:42:04,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:42:04,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2022-12-14 11:42:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389180625] [2022-12-14 11:42:04,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:42:04,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 11:42:04,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 11:42:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-14 11:42:04,049 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-14 11:42:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:04,271 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2022-12-14 11:42:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:42:04,272 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) Word has length 69 [2022-12-14 11:42:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:04,273 INFO L225 Difference]: With dead ends: 105 [2022-12-14 11:42:04,273 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 11:42:04,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:42:04,274 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:04,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 376 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 11:42:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-12-14 11:42:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (29), 16 states have call predecessors, (29), 8 states have call successors, (29) [2022-12-14 11:42:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2022-12-14 11:42:04,282 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 69 [2022-12-14 11:42:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:04,282 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2022-12-14 11:42:04,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-14 11:42:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-12-14 11:42:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 11:42:04,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:04,283 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:04,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:42:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 11:42:04,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1734203497, now seen corresponding path program 1 times [2022-12-14 11:42:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024118269] [2022-12-14 11:42:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 11:42:04,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:04,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024118269] [2022-12-14 11:42:04,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024118269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:42:04,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:42:04,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:42:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981607399] [2022-12-14 11:42:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:42:04,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:42:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:42:04,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:42:04,644 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 11:42:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:04,695 INFO L93 Difference]: Finished difference Result 147 states and 212 transitions. [2022-12-14 11:42:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:42:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-12-14 11:42:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:04,696 INFO L225 Difference]: With dead ends: 147 [2022-12-14 11:42:04,697 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 11:42:04,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:42:04,698 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:04,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:42:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 11:42:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 11:42:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2022-12-14 11:42:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2022-12-14 11:42:04,704 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 76 [2022-12-14 11:42:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:04,705 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2022-12-14 11:42:04,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 11:42:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-12-14 11:42:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 11:42:04,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:42:04,706 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:42:04,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:42:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:42:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1605702583, now seen corresponding path program 2 times [2022-12-14 11:42:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:42:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914303631] [2022-12-14 11:42:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:42:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:42:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:42:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 11:42:04,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:42:04,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914303631] [2022-12-14 11:42:04,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914303631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:42:04,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606314228] [2022-12-14 11:42:04,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:42:04,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:42:04,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:42:04,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:42:04,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 11:42:04,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 11:42:04,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:42:04,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 11:42:04,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:42:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:42:05,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:42:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 11:42:05,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606314228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:42:05,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1411592347] [2022-12-14 11:42:05,485 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-12-14 11:42:05,485 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:42:05,485 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:42:05,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:42:05,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2022-12-14 11:42:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622958260] [2022-12-14 11:42:05,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:42:05,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 11:42:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:42:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 11:42:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-14 11:42:05,487 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-12-14 11:42:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:42:05,657 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2022-12-14 11:42:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:42:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 85 [2022-12-14 11:42:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:42:05,658 INFO L225 Difference]: With dead ends: 118 [2022-12-14 11:42:05,658 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 11:42:05,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2022-12-14 11:42:05,659 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:42:05,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 226 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:42:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 11:42:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 11:42:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:42:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 11:42:05,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2022-12-14 11:42:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:42:05,660 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 11:42:05,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-12-14 11:42:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 11:42:05,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 11:42:05,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 11:42:05,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 11:42:05,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 11:42:05,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 11:42:05,985 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= |multiple_of_#in~n| multiple_of_~n) (<= |multiple_of_#in~m| multiple_of_~m) (<= (+ |multiple_of_#in~m| 1) 0)) [2022-12-14 11:42:05,985 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2022-12-14 11:42:05,985 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n) (< 0 multiple_of_~n)) [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 31 45) the Hoare annotation is: true [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ multiple_of_~n 1) 0) (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n)) [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-12-14 11:42:05,986 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| mult_~m) (< 1 mult_~m)) [2022-12-14 11:42:05,986 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 28) the Hoare annotation is: true [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2022-12-14 11:42:05,987 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L902 garLoopResultBuilder]: At program point L97-5(lines 76 102) the Hoare annotation is: true [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-12-14 11:42:05,988 INFO L895 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~n~0#1|))) (or (and (= |ULTIMATE.start_is_prime_#t~ret9#1| 0) .cse0) (and (<= |ULTIMATE.start_main_~n~0#1| 2) .cse0 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)))) [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-12-14 11:42:05,988 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 57 74) the Hoare annotation is: true [2022-12-14 11:42:05,989 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m))) (.cse1 (<= |is_prime__#in~n| is_prime__~n)) (.cse2 (<= is_prime__~m |is_prime__#in~m|))) (or (and (<= |is_prime__#in~n| |is_prime__#in~m|) .cse0 .cse1 (< 2 is_prime__~n) .cse2) (and (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|) (<= 2 is_prime__~m) .cse0 .cse1 .cse2))) [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (<= 2 is_prime__~m) (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m)) (<= |is_prime__#in~n| is_prime__~n) (< 2 is_prime__~n) (<= is_prime__~m |is_prime__#in~m|)) [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2022-12-14 11:42:05,989 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2022-12-14 11:42:05,992 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:42:05,993 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:42:06,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:42:06 BoogieIcfgContainer [2022-12-14 11:42:06,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:42:06,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:42:06,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:42:06,003 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:42:06,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:41:58" (3/4) ... [2022-12-14 11:42:06,005 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 11:42:06,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2022-12-14 11:42:06,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2022-12-14 11:42:06,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2022-12-14 11:42:06,012 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-14 11:42:06,012 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 11:42:06,012 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 11:42:06,012 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:42:06,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:42:06,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:42:06,036 INFO L158 Benchmark]: Toolchain (without parser) took 8443.59ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 80.7MB in the beginning and 90.7MB in the end (delta: -10.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,036 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 74.6MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:42:06,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.71ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 69.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 125.8MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,037 INFO L158 Benchmark]: Boogie Preprocessor took 15.29ms. Allocated memory is still 125.8MB. Free memory was 68.2MB in the beginning and 66.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:42:06,037 INFO L158 Benchmark]: RCFGBuilder took 290.54ms. Allocated memory is still 125.8MB. Free memory was 66.9MB in the beginning and 89.9MB in the end (delta: -23.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,037 INFO L158 Benchmark]: TraceAbstraction took 7901.23ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 89.2MB in the beginning and 93.9MB in the end (delta: -4.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,038 INFO L158 Benchmark]: Witness Printer took 33.53ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 90.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:42:06,039 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.15ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 74.6MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.71ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 69.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 125.8MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.29ms. Allocated memory is still 125.8MB. Free memory was 68.2MB in the beginning and 66.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.54ms. Allocated memory is still 125.8MB. Free memory was 66.9MB in the beginning and 89.9MB in the end (delta: -23.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7901.23ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 89.2MB in the beginning and 93.9MB in the end (delta: -4.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 33.53ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 90.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 3863 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3031 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1414 IncrementalHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 832 mSDtfsCounter, 1414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 696 SyntacticMatches, 22 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 256 PreInvPairs, 304 NumberOfFragments, 153 HoareAnnotationTreeSize, 256 FomulaSimplifications, 227 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 219 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1207 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 3540 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1220 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 518/702 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (aux-is_prime_(n, n - 1)-aux == 0 && 1 <= n) || ((n <= 2 && 1 <= n) && n <= n) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 11:42:06,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bda7e2ec-baa7-474d-b1d0-ef69d018b190/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE