./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/prefixsum_rec.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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- 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 07:58:10,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:58:10,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:58:10,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:58:10,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:58:10,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:58:10,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:58:10,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:58:10,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:58:10,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:58:10,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:58:10,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:58:10,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:58:10,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:58:10,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:58:10,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:58:10,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:58:10,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:58:10,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:58:10,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:58:10,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:58:10,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:58:10,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:58:10,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:58:10,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:58:10,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:58:10,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:58:10,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:58:10,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:58:10,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:58:10,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:58:10,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:58:10,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:58:10,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:58:10,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:58:10,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:58:10,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:58:10,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:58:10,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:58:10,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:58:10,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:58:10,229 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:58:10,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:58:10,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:58:10,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:58:10,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:58:10,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:58:10,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:58:10,249 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:58:10,249 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:58:10,250 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:58:10,250 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:58:10,250 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:58:10,251 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:58:10,251 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:58:10,251 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:58:10,251 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:58:10,251 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:58:10,251 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:58:10,252 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:58:10,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:58:10,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:58:10,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:58:10,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:58:10,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:58:10,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:58:10,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:58:10,254 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:58:10,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:58:10,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:58:10,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:58:10,255 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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-12-14 07:58:10,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:58:10,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:58:10,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:58:10,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:58:10,469 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:58:10,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-12-14 07:58:13,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:58:13,201 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:58:13,201 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-12-14 07:58:13,206 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/data/8905f02ae/04f5eb10665c4c159cee1ac1c491e371/FLAG1ed5c8eb1 [2022-12-14 07:58:13,618 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/data/8905f02ae/04f5eb10665c4c159cee1ac1c491e371 [2022-12-14 07:58:13,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:58:13,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:58:13,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:58:13,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:58:13,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:58:13,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321dccca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13, skipping insertion in model container [2022-12-14 07:58:13,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:58:13,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:58:13,755 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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-12-14 07:58:13,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:58:13,791 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:58:13,801 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_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-12-14 07:58:13,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:58:13,820 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:58:13,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13 WrapperNode [2022-12-14 07:58:13,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:58:13,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:58:13,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:58:13,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:58:13,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,853 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-12-14 07:58:13,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:58:13,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:58:13,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:58:13,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:58:13,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:58:13,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:58:13,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:58:13,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:58:13,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (1/1) ... [2022-12-14 07:58:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:58:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:13,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:58:13,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:58:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:58:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 07:58:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 07:58:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:58:13,942 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-12-14 07:58:13,942 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-12-14 07:58:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:58:13,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:58:13,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-14 07:58:13,944 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-14 07:58:13,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:58:14,009 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:58:14,011 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:58:14,199 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:58:14,232 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:58:14,232 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 07:58:14,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:58:14 BoogieIcfgContainer [2022-12-14 07:58:14,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:58:14,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:58:14,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:58:14,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:58:14,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:58:13" (1/3) ... [2022-12-14 07:58:14,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:58:14, skipping insertion in model container [2022-12-14 07:58:14,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:58:13" (2/3) ... [2022-12-14 07:58:14,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee4613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:58:14, skipping insertion in model container [2022-12-14 07:58:14,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:58:14" (3/3) ... [2022-12-14 07:58:14,240 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-12-14 07:58:14,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:58:14,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:58:14,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:58:14,293 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;@5baa2af9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:58:14,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:58:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:58:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 07:58:14,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:14,307 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:58:14,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1948326030, now seen corresponding path program 1 times [2022-12-14 07:58:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976504756] [2022-12-14 07:58:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:58:14,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:14,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976504756] [2022-12-14 07:58:14,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976504756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:58:14,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:58:14,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 07:58:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574823254] [2022-12-14 07:58:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:58:14,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:58:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:58:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:58:14,782 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 07:58:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:14,942 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-12-14 07:58:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:58:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-12-14 07:58:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:14,949 INFO L225 Difference]: With dead ends: 75 [2022-12-14 07:58:14,949 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 07:58:14,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:58:14,954 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:14,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 179 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:58:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 07:58:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-12-14 07:58:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:58:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-12-14 07:58:14,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 34 [2022-12-14 07:58:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:14,988 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-12-14 07:58:14,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 07:58:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-12-14 07:58:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 07:58:14,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:14,989 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:58:14,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:58:14,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1255318274, now seen corresponding path program 1 times [2022-12-14 07:58:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:14,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303328748] [2022-12-14 07:58:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:15,155 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 07:58:15,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:15,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303328748] [2022-12-14 07:58:15,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303328748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:15,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434178282] [2022-12-14 07:58:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:15,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:15,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:15,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:15,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:58:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:15,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:58:15,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:15,333 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 07:58:15,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:15,397 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 07:58:15,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434178282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:58:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440968728] [2022-12-14 07:58:15,418 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-12-14 07:58:15,418 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:15,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:15,427 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:15,427 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:15,714 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:15,716 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:58:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1440968728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:58:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:58:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6, 6] total 17 [2022-12-14 07:58:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799075941] [2022-12-14 07:58:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:58:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:58:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:58:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-14 07:58:16,020 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 07:58:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:16,155 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-12-14 07:58:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:58:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2022-12-14 07:58:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:16,156 INFO L225 Difference]: With dead ends: 69 [2022-12-14 07:58:16,156 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 07:58:16,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-14 07:58:16,158 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:16,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 55 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:58:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 07:58:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 07:58:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:58:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-12-14 07:58:16,168 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 35 [2022-12-14 07:58:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:16,168 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-12-14 07:58:16,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 07:58:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-12-14 07:58:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 07:58:16,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:16,170 INFO L195 NwaCegarLoop]: trace histogram [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 07:58:16,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:58:16,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:16,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash 62074530, now seen corresponding path program 1 times [2022-12-14 07:58:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:16,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405482461] [2022-12-14 07:58:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:58:16,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:16,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405482461] [2022-12-14 07:58:16,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405482461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:16,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029222857] [2022-12-14 07:58:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:16,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:16,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:16,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:58:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:16,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:58:16,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:58:16,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:58:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029222857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:58:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [300782458] [2022-12-14 07:58:16,840 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-12-14 07:58:16,840 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:16,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:16,841 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:16,841 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:17,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:58:17,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 07:58:17,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:17,285 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:58:17,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 127 [2022-12-14 07:58:17,307 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:58:17,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 130 [2022-12-14 07:58:17,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:17,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:17,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:17,520 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:17,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 07:58:17,619 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-12-14 07:58:17,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 235 treesize of output 232 [2022-12-14 07:58:17,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:58:17,677 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:58:17,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 07:58:17,738 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-12-14 07:58:17,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 07:58:17,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:17,843 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 07:58:17,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 07:58:17,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:17,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:18,072 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-12-14 07:58:18,082 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-12-14 07:58:18,106 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:18,108 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 42 for LOIs [2022-12-14 07:58:18,118 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:58:21,047 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '823#(and (= |ULTIMATE.start_check_~a#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_check_#in~n#1| |ULTIMATE.start_check_~n#1|) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start_check_#in~a#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (= |ULTIMATE.start_check_#in~a0#1.base| |ULTIMATE.start_check_~a0#1.base|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (= |ULTIMATE.start_check_~sum~0#1| 0) (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_check_#in~a0#1.base|) (= |ULTIMATE.start_check_~i~0#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_check_#in~n#1|) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| (+ (ite (and (not (= (mod |ULTIMATE.start_main_~n~0#1| 2) 0)) (< |ULTIMATE.start_main_~n~0#1| 0)) (+ (div |ULTIMATE.start_main_~n~0#1| 2) 1) (div |ULTIMATE.start_main_~n~0#1| 2)) 1)) (= |ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_#in~a#1.base|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_check_~a0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-12-14 07:58:21,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:58:21,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:58:21,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 07:58:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644631981] [2022-12-14 07:58:21,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:58:21,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 07:58:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 07:58:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 07:58:21,050 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-14 07:58:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:21,157 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-12-14 07:58:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:58:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 36 [2022-12-14 07:58:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:21,159 INFO L225 Difference]: With dead ends: 60 [2022-12-14 07:58:21,159 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 07:58:21,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 07:58:21,161 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:21,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:58:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 07:58:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 07:58:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:58:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-12-14 07:58:21,168 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 36 [2022-12-14 07:58:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:21,169 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-12-14 07:58:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-14 07:58:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-12-14 07:58:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 07:58:21,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:21,170 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:58:21,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 07:58:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:21,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1383903378, now seen corresponding path program 2 times [2022-12-14 07:58:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:21,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985332831] [2022-12-14 07:58:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:58:22,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985332831] [2022-12-14 07:58:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985332831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491419734] [2022-12-14 07:58:22,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:58:22,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:22,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:22,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:58:22,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:58:22,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:58:22,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 07:58:22,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:22,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:22,844 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_112 Int) (downsweep_~left Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_112) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2022-12-14 07:58:22,872 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2022-12-14 07:58:22,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 27 [2022-12-14 07:58:22,986 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 07:58:22,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-12-14 07:58:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:58:23,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:23,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491419734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:23,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851074384] [2022-12-14 07:58:23,221 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-12-14 07:58:23,221 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:23,222 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:23,222 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:23,222 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:23,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 07:58:23,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:58:23,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:23,649 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:58:23,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 127 [2022-12-14 07:58:23,671 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:58:23,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 130 [2022-12-14 07:58:23,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:23,756 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:23,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:23,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:23,909 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-12-14 07:58:23,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 206 [2022-12-14 07:58:23,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:58:23,953 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:58:23,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 07:58:23,982 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-12-14 07:58:23,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 07:58:24,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:24,038 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 07:58:24,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 07:58:24,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:24,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:24,190 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-12-14 07:58:24,199 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-12-14 07:58:24,220 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:24,221 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-12-14 07:58:24,228 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:58:27,740 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1156#(and (= |ULTIMATE.start_check_~a#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_check_#in~n#1| |ULTIMATE.start_check_~n#1|) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start_check_#in~a#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (= |ULTIMATE.start_check_#in~a0#1.base| |ULTIMATE.start_check_~a0#1.base|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (= |ULTIMATE.start_check_~sum~0#1| 0) (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_check_#in~a0#1.base|) (= |ULTIMATE.start_check_~i~0#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_check_#in~n#1|) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| (+ (ite (and (not (= (mod |ULTIMATE.start_main_~n~0#1| 2) 0)) (< |ULTIMATE.start_main_~n~0#1| 0)) (+ (div |ULTIMATE.start_main_~n~0#1| 2) 1) (div |ULTIMATE.start_main_~n~0#1| 2)) 1)) (= |ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_#in~a#1.base|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_check_~a0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-12-14 07:58:27,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:58:27,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:58:27,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2022-12-14 07:58:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210088036] [2022-12-14 07:58:27,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 07:58:27,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 07:58:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:27,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 07:58:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2938, Unknown=1, NotChecked=110, Total=3306 [2022-12-14 07:58:27,746 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-12-14 07:58:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:30,584 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-12-14 07:58:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 07:58:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 37 [2022-12-14 07:58:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:30,587 INFO L225 Difference]: With dead ends: 68 [2022-12-14 07:58:30,587 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 07:58:30,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=522, Invalid=5643, Unknown=1, NotChecked=154, Total=6320 [2022-12-14 07:58:30,589 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 117 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:30,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 191 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 719 Invalid, 0 Unknown, 54 Unchecked, 0.9s Time] [2022-12-14 07:58:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 07:58:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-12-14 07:58:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-14 07:58:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-12-14 07:58:30,601 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 37 [2022-12-14 07:58:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:30,602 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-14 07:58:30,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-12-14 07:58:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-12-14 07:58:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 07:58:30,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:30,603 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:58:30,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:58:30,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:30,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -469006853, now seen corresponding path program 1 times [2022-12-14 07:58:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:30,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522549991] [2022-12-14 07:58:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:58:32,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:32,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522549991] [2022-12-14 07:58:32,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522549991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:32,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517829266] [2022-12-14 07:58:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:32,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:32,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:32,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:32,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:58:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:32,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-14 07:58:32,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:32,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:58:32,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:32,674 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:58:32,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 07:58:32,696 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_154 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_154) |c_#memory_int|)) is different from true [2022-12-14 07:58:32,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:58:32,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-12-14 07:58:32,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 07:58:32,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-14 07:58:32,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 07:58:32,884 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1))))) |c_#memory_int|)) is different from true [2022-12-14 07:58:32,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-12-14 07:58:32,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-14 07:58:32,996 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_164 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_164)))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-12-14 07:58:33,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-14 07:58:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2022-12-14 07:58:33,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2022-12-14 07:58:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-12-14 07:58:33,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:42,063 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:58:42,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517829266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:42,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1394227822] [2022-12-14 07:58:42,066 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 07:58:42,066 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:42,066 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:42,066 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:42,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:42,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:58:42,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 07:58:42,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:42,311 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:58:42,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 127 [2022-12-14 07:58:42,335 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:58:42,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 130 [2022-12-14 07:58:42,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:42,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:42,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:42,517 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:42,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 07:58:42,608 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-12-14 07:58:42,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 241 treesize of output 238 [2022-12-14 07:58:42,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:58:42,657 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:58:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 07:58:42,693 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-12-14 07:58:42,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 07:58:42,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:42,757 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 07:58:42,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 07:58:42,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:42,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:43,099 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-12-14 07:58:43,107 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-12-14 07:58:43,125 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:43,126 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-12-14 07:58:43,132 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:58:48,633 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1573#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-12-14 07:58:48,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:58:48,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:58:48,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2022-12-14 07:58:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422739874] [2022-12-14 07:58:48,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 07:58:48,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 07:58:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 07:58:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4254, Unknown=4, NotChecked=402, Total=4970 [2022-12-14 07:58:48,636 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 07:58:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:51,264 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-12-14 07:58:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 07:58:51,264 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 40 [2022-12-14 07:58:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:51,265 INFO L225 Difference]: With dead ends: 68 [2022-12-14 07:58:51,265 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 07:58:51,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=556, Invalid=7462, Unknown=4, NotChecked=534, Total=8556 [2022-12-14 07:58:51,268 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:51,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 241 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 899 Invalid, 0 Unknown, 191 Unchecked, 0.9s Time] [2022-12-14 07:58:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 07:58:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-12-14 07:58:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2022-12-14 07:58:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-12-14 07:58:51,289 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 40 [2022-12-14 07:58:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:51,289 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-12-14 07:58:51,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 07:58:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-12-14 07:58:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 07:58:51,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:51,291 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:58:51,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:58:51,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:51,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -200908601, now seen corresponding path program 2 times [2022-12-14 07:58:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:51,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52238943] [2022-12-14 07:58:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:58:51,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52238943] [2022-12-14 07:58:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52238943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387876918] [2022-12-14 07:58:51,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:58:51,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:51,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:51,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:51,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:58:51,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:58:51,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:58:51,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 07:58:51,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:58:51,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:58:51,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387876918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:58:51,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859122360] [2022-12-14 07:58:51,943 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 07:58:51,943 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:51,943 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:51,943 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:51,943 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:52,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 07:58:52,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:58:52,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:52,231 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:58:52,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 127 [2022-12-14 07:58:52,252 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:58:52,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 130 [2022-12-14 07:58:52,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:52,329 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:52,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:52,398 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:52,451 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-12-14 07:58:52,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 196 [2022-12-14 07:58:52,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:58:52,495 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:58:52,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 07:58:52,527 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-12-14 07:58:52,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 07:58:52,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:52,584 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 07:58:52,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 07:58:52,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:52,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:52,909 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-12-14 07:58:52,917 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-12-14 07:58:52,937 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:52,938 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-12-14 07:58:52,945 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:58:56,408 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2080#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-12-14 07:58:56,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:58:56,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:58:56,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 17 [2022-12-14 07:58:56,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141767048] [2022-12-14 07:58:56,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:58:56,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 07:58:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:58:56,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 07:58:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 07:58:56,410 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 07:58:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:58:56,632 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-12-14 07:58:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:58:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 41 [2022-12-14 07:58:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:58:56,633 INFO L225 Difference]: With dead ends: 81 [2022-12-14 07:58:56,633 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 07:58:56,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=201, Invalid=2055, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:58:56,634 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:58:56,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 228 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:58:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 07:58:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2022-12-14 07:58:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 13 states have call successors, (20) [2022-12-14 07:58:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-12-14 07:58:56,645 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 41 [2022-12-14 07:58:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:58:56,645 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-12-14 07:58:56,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 07:58:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-12-14 07:58:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 07:58:56,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:58:56,647 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:58:56,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:58:56,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:56,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:58:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:58:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash -649090994, now seen corresponding path program 3 times [2022-12-14 07:58:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:58:56,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931014787] [2022-12-14 07:58:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:58:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:58:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:58:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:58:57,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:58:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931014787] [2022-12-14 07:58:57,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931014787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:58:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852328823] [2022-12-14 07:58:57,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:58:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:58:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:58:57,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:58:57,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:58:57,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:58:57,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:58:57,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 07:58:57,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:58:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:58:57,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:58:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:58:57,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852328823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:58:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1156946313] [2022-12-14 07:58:57,217 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 07:58:57,218 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:58:57,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:58:57,218 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:58:57,218 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:58:57,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 07:58:57,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:58:57,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:58:57,630 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:58:57,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 127 [2022-12-14 07:58:57,647 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:58:57,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 130 [2022-12-14 07:58:57,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:57,721 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:57,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 07:58:57,780 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:58:57,830 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-12-14 07:58:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 206 [2022-12-14 07:58:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:58:57,866 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:58:57,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 07:58:57,899 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-12-14 07:58:57,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-12-14 07:58:57,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:58:57,968 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 07:58:57,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 07:58:57,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:57,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-12-14 07:58:58,281 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-12-14 07:58:58,293 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-12-14 07:58:58,313 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-12-14 07:58:58,314 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-12-14 07:58:58,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:59:02,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2577#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (<= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc15#1.offset|) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-12-14 07:59:02,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:59:02,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:59:02,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-12-14 07:59:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756745009] [2022-12-14 07:59:02,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:59:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 07:59:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 07:59:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:59:02,040 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 07:59:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:02,150 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-12-14 07:59:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:59:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-12-14 07:59:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:02,151 INFO L225 Difference]: With dead ends: 75 [2022-12-14 07:59:02,152 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 07:59:02,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 07:59:02,152 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:02,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 212 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 07:59:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-12-14 07:59:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2022-12-14 07:59:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-12-14 07:59:02,163 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 43 [2022-12-14 07:59:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:02,163 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-12-14 07:59:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 07:59:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-12-14 07:59:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 07:59:02,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:02,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:02,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:59:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 07:59:02,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1951059634, now seen corresponding path program 1 times [2022-12-14 07:59:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:02,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929180197] [2022-12-14 07:59:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:59:02,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:02,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929180197] [2022-12-14 07:59:02,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929180197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:02,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382594020] [2022-12-14 07:59:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:02,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:59:02,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:59:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:02,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:59:02,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:59:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:59:02,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:59:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 07:59:02,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382594020] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:59:02,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182020046] [2022-12-14 07:59:02,912 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 07:59:02,912 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:59:02,913 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 07:59:02,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:59:02,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 19 [2022-12-14 07:59:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886792254] [2022-12-14 07:59:02,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:59:02,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:59:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:59:02,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:59:02,917 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-12-14 07:59:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:03,225 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-12-14 07:59:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:59:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2022-12-14 07:59:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:03,226 INFO L225 Difference]: With dead ends: 71 [2022-12-14 07:59:03,226 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 07:59:03,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-12-14 07:59:03,226 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:03,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 208 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:59:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 07:59:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-12-14 07:59:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-12-14 07:59:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2022-12-14 07:59:03,237 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 47 [2022-12-14 07:59:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2022-12-14 07:59:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-12-14 07:59:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-12-14 07:59:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 07:59:03,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:03,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:03,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:59:03,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:03,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -525422981, now seen corresponding path program 1 times [2022-12-14 07:59:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:03,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469601287] [2022-12-14 07:59:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:59:03,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469601287] [2022-12-14 07:59:03,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469601287] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247603571] [2022-12-14 07:59:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:03,579 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:59:03,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:59:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:03,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:59:03,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:59:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:59:03,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:59:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:59:03,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247603571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:59:03,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72482734] [2022-12-14 07:59:03,921 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 07:59:03,921 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:59:03,922 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 07:59:03,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:59:03,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-14 07:59:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449816487] [2022-12-14 07:59:03,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:59:03,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 07:59:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:03,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 07:59:03,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:59:03,924 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-12-14 07:59:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:04,095 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-12-14 07:59:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:59:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 50 [2022-12-14 07:59:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:04,096 INFO L225 Difference]: With dead ends: 69 [2022-12-14 07:59:04,096 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 07:59:04,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:59:04,097 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:04,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 07:59:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 07:59:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-12-14 07:59:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-12-14 07:59:04,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 50 [2022-12-14 07:59:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:04,103 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-14 07:59:04,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-12-14 07:59:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-12-14 07:59:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 07:59:04,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:04,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:04,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 07:59:04,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:04,306 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1130368898, now seen corresponding path program 1 times [2022-12-14 07:59:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:04,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189709029] [2022-12-14 07:59:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 07:59:04,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189709029] [2022-12-14 07:59:04,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189709029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355782012] [2022-12-14 07:59:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:04,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:04,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:04,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:59:04,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:59:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:04,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 165 conjunts are in the unsatisfiable core [2022-12-14 07:59:04,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:59:04,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:59:04,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-14 07:59:04,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:59:04,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 07:59:04,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:59:04,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-14 07:59:04,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:59:04,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:59:04,929 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (upsweep_~a.offset Int) (v_ArrVal_395 Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_395)) |c_#memory_int|))) is different from true [2022-12-14 07:59:05,139 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_397 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_397)) |c_#memory_int|)) is different from true [2022-12-14 07:59:08,118 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_399 Int) (v_upsweep_~a.offset_41 Int) (upsweep_~a.offset Int) (v_ArrVal_395 Int) (v_upsweep_~right_41 Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (<= upsweep_~a.offset v_upsweep_~a.offset_41) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ v_upsweep_~a.offset_41 (* v_upsweep_~right_41 4)) v_ArrVal_395) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_399)) |c_#memory_int|) (<= |c_upsweep_#in~left| v_upsweep_~right_41) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2022-12-14 07:59:08,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-12-14 07:59:08,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-12-14 07:59:10,508 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_406 Int)) (and (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_406))) |c_#memory_int|))) is different from true [2022-12-14 07:59:10,660 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_410 Int) (downsweep_~left Int) (v_ArrVal_409 Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_410) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_409))) (<= |c_downsweep_#in~right| downsweep_~right) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-12-14 07:59:12,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 135 [2022-12-14 07:59:20,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2022-12-14 07:59:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 11 not checked. [2022-12-14 07:59:20,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:59:23,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355782012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:23,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018224693] [2022-12-14 07:59:23,324 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 07:59:23,324 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:59:23,325 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 07:59:23,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:59:23,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 37] total 43 [2022-12-14 07:59:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520477637] [2022-12-14 07:59:23,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 07:59:23,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 07:59:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:23,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 07:59:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1601, Unknown=9, NotChecked=420, Total=2162 [2022-12-14 07:59:23,327 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 43 states, 29 states have (on average 2.103448275862069) internal successors, (61), 34 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-12-14 07:59:36,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:41,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:46,057 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2022-12-14 07:59:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 07:59:46,057 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 29 states have (on average 2.103448275862069) internal successors, (61), 34 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 58 [2022-12-14 07:59:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:46,058 INFO L225 Difference]: With dead ends: 78 [2022-12-14 07:59:46,058 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 07:59:46,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=371, Invalid=4192, Unknown=13, NotChecked=680, Total=5256 [2022-12-14 07:59:46,059 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 63 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:46,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 220 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1192 Invalid, 4 Unknown, 334 Unchecked, 6.5s Time] [2022-12-14 07:59:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 07:59:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-12-14 07:59:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (19), 12 states have call predecessors, (19), 11 states have call successors, (19) [2022-12-14 07:59:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-12-14 07:59:46,069 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 58 [2022-12-14 07:59:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:46,070 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-12-14 07:59:46,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 29 states have (on average 2.103448275862069) internal successors, (61), 34 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-12-14 07:59:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-12-14 07:59:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 07:59:46,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:46,070 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:46,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 07:59:46,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9b50771-f976-4ecf-8ef4-9d01e8eddfbf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:46,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash 64900942, now seen corresponding path program 2 times [2022-12-14 07:59:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:46,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295582634] [2022-12-14 07:59:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat