./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff 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_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:15:18,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:15:18,866 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-19 05:15:18,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:15:18,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:15:18,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:15:18,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:15:18,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:15:18,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:15:18,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:15:18,910 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:15:18,911 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:15:18,911 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:15:18,912 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:15:18,913 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:15:18,913 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:15:18,914 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:15:18,915 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:15:18,916 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:15:18,916 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:15:18,917 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:15:18,918 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:15:18,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:15:18,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:15:18,921 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:15:18,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:15:18,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:15:18,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:15:18,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:15:18,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:15:18,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:15:18,925 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 05:15:18,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:15:18,927 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:15:18,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:15:18,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:15:18,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:15:18,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:15:18,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:15:18,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:15:18,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:15:18,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:15:18,932 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:15:18,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:15:18,933 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:15:18,933 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:15:18,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:15:18,934 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/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_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! overflow) ) 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2023-11-19 05:15:19,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:15:19,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:15:19,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:15:19,263 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:15:19,263 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:15:19,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 05:15:22,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:15:23,022 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:15:23,022 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 05:15:23,032 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/data/a782930c6/ed77fc1701714ca5a8675971be1c0029/FLAG0963f0a07 [2023-11-19 05:15:23,049 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/data/a782930c6/ed77fc1701714ca5a8675971be1c0029 [2023-11-19 05:15:23,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:15:23,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:15:23,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:15:23,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:15:23,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:15:23,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7153983b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23, skipping insertion in model container [2023-11-19 05:15:23,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,098 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:15:23,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:15:23,346 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:15:23,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:15:23,387 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:15:23,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23 WrapperNode [2023-11-19 05:15:23,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:15:23,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:15:23,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:15:23,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:15:23,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,432 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2023-11-19 05:15:23,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:15:23,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:15:23,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:15:23,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:15:23,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:15:23,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:15:23,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:15:23,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:15:23,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (1/1) ... [2023-11-19 05:15:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:15:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:15:23,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:15:23,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:15:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:15:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:15:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:15:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:15:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 05:15:23,586 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 05:15:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:15:23,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:15:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:15:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 05:15:23,588 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 05:15:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:15:23,678 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:15:23,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:15:23,890 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:15:23,942 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:15:23,943 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:15:23,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:23 BoogieIcfgContainer [2023-11-19 05:15:23,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:15:23,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:15:23,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:15:23,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:15:23,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:15:23" (1/3) ... [2023-11-19 05:15:23,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704a9f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:23, skipping insertion in model container [2023-11-19 05:15:23,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:23" (2/3) ... [2023-11-19 05:15:23,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704a9f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:23, skipping insertion in model container [2023-11-19 05:15:23,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:23" (3/3) ... [2023-11-19 05:15:23,976 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-19 05:15:23,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:15:23,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 05:15:24,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:15:24,096 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=LoopHeads, 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;@b472796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:15:24,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 05:15:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:15:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:15:24,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:24,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:24,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:24,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1297816494, now seen corresponding path program 1 times [2023-11-19 05:15:24,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584224461] [2023-11-19 05:15:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:24,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584224461] [2023-11-19 05:15:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584224461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:15:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294752302] [2023-11-19 05:15:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:24,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:15:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:15:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:24,974 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:25,170 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-19 05:15:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:15:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 05:15:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:25,184 INFO L225 Difference]: With dead ends: 51 [2023-11-19 05:15:25,184 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 05:15:25,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:15:25,196 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:25,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 05:15:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-19 05:15:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:15:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-19 05:15:25,253 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2023-11-19 05:15:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:25,254 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-19 05:15:25,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-19 05:15:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:15:25,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:25,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:25,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:15:25,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:25,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1577605575, now seen corresponding path program 1 times [2023-11-19 05:15:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862750031] [2023-11-19 05:15:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:25,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862750031] [2023-11-19 05:15:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862750031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:15:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407665318] [2023-11-19 05:15:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:25,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:15:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:15:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:15:25,454 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:25,515 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-19 05:15:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:15:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:15:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:25,519 INFO L225 Difference]: With dead ends: 23 [2023-11-19 05:15:25,519 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 05:15:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:15:25,526 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:25,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:15:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 05:15:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-19 05:15:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:15:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-19 05:15:25,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-11-19 05:15:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:25,546 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-19 05:15:25,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-19 05:15:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:15:25,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:25,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:25,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:15:25,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:25,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -184519128, now seen corresponding path program 1 times [2023-11-19 05:15:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087099209] [2023-11-19 05:15:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:25,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:25,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087099209] [2023-11-19 05:15:25,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087099209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:25,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:25,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:15:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773428235] [2023-11-19 05:15:25,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:25,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:15:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:15:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:15:25,986 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:26,174 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-19 05:15:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:15:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:15:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:26,179 INFO L225 Difference]: With dead ends: 28 [2023-11-19 05:15:26,179 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 05:15:26,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:15:26,182 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:26,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 05:15:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-11-19 05:15:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:15:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-19 05:15:26,195 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2023-11-19 05:15:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:26,196 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-19 05:15:26,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-19 05:15:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:15:26,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:26,198 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:26,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:15:26,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:26,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1314281524, now seen corresponding path program 1 times [2023-11-19 05:15:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:26,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801752159] [2023-11-19 05:15:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:15:26,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801752159] [2023-11-19 05:15:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801752159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:15:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653876261] [2023-11-19 05:15:26,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:15:26,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:15:26,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:15:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:26,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 05:15:26,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:15:26,831 INFO L378 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 11 treesize of output 7 [2023-11-19 05:15:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:15:27,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:15:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:27,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653876261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:15:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898905933] [2023-11-19 05:15:27,853 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-19 05:15:27,854 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:15:27,859 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:96) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:15:27,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:15:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2023-11-19 05:15:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199930397] [2023-11-19 05:15:27,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:15:27,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-19 05:15:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:27,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-19 05:15:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-11-19 05:15:27,869 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:15:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:28,245 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-19 05:15:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:15:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 18 [2023-11-19 05:15:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:28,248 INFO L225 Difference]: With dead ends: 46 [2023-11-19 05:15:28,248 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 05:15:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2023-11-19 05:15:28,255 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:28,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:15:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 05:15:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 05:15:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 05:15:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-11-19 05:15:28,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2023-11-19 05:15:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:28,269 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-19 05:15:28,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:15:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-11-19 05:15:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 05:15:28,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:28,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:28,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:15:28,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:28,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:28,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2070315004, now seen corresponding path program 2 times [2023-11-19 05:15:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:28,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366738396] [2023-11-19 05:15:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:15:29,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366738396] [2023-11-19 05:15:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366738396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:15:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606147562] [2023-11-19 05:15:29,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:15:29,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:15:29,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:15:29,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:15:29,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 05:15:29,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:15:29,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-19 05:15:29,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:15:29,712 INFO L378 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 11 treesize of output 7 [2023-11-19 05:15:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 05:15:30,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:15:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606147562] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:15:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176052427] [2023-11-19 05:15:32,241 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-19 05:15:32,241 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:15:32,242 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:96) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:15:32,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:15:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 42 [2023-11-19 05:15:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865754001] [2023-11-19 05:15:32,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:15:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-19 05:15:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-19 05:15:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1439, Unknown=0, NotChecked=0, Total=1722 [2023-11-19 05:15:32,248 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 05:15:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:32,901 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-19 05:15:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 05:15:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 32 [2023-11-19 05:15:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:32,904 INFO L225 Difference]: With dead ends: 54 [2023-11-19 05:15:32,904 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 05:15:32,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=2137, Unknown=0, NotChecked=0, Total=2550 [2023-11-19 05:15:32,907 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:32,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 116 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:15:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 05:15:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 05:15:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-19 05:15:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-11-19 05:15:32,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 32 [2023-11-19 05:15:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:32,926 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-11-19 05:15:32,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 05:15:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-11-19 05:15:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 05:15:32,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:32,929 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:32,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:15:33,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:33,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:33,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 971976660, now seen corresponding path program 3 times [2023-11-19 05:15:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748729750] [2023-11-19 05:15:33,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-19 05:15:34,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748729750] [2023-11-19 05:15:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748729750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:15:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973553532] [2023-11-19 05:15:34,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:15:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:15:34,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:15:34,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:15:34,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:15:34,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:15:34,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-19 05:15:34,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:15:34,806 INFO L378 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 11 treesize of output 7 [2023-11-19 05:15:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-19 05:15:35,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:15:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973553532] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:15:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1114485975] [2023-11-19 05:15:39,624 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-19 05:15:39,624 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:15:39,624 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:96) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:15:39,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:15:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 31] total 55 [2023-11-19 05:15:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951673240] [2023-11-19 05:15:39,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:15:39,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-19 05:15:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-19 05:15:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2474, Unknown=0, NotChecked=0, Total=2970 [2023-11-19 05:15:39,632 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-19 05:15:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:40,455 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-11-19 05:15:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:15:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 46 [2023-11-19 05:15:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:40,458 INFO L225 Difference]: With dead ends: 60 [2023-11-19 05:15:40,458 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 05:15:40,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=707, Invalid=3453, Unknown=0, NotChecked=0, Total=4160 [2023-11-19 05:15:40,463 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:40,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 148 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:15:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 05:15:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-19 05:15:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 05:15:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-11-19 05:15:40,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 46 [2023-11-19 05:15:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:40,474 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-19 05:15:40,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-19 05:15:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-11-19 05:15:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-19 05:15:40,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:40,477 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:40,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:15:40,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:40,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:15:40,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1290190258, now seen corresponding path program 4 times [2023-11-19 05:15:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920313105] [2023-11-19 05:15:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-19 05:15:46,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:46,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920313105] [2023-11-19 05:15:46,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920313105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:15:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912139274] [2023-11-19 05:15:46,002 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:15:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:15:46,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:15:46,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:15:46,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:15:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:46,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-19 05:15:46,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:15:46,178 INFO L378 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 11 treesize of output 7 [2023-11-19 05:15:46,186 INFO L378 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 10 treesize of output 8 [2023-11-19 05:15:46,212 INFO L378 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 16 treesize of output 11 [2023-11-19 05:15:48,455 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from false [2023-11-19 05:15:50,459 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from true [2023-11-19 05:15:52,517 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from false [2023-11-19 05:15:54,519 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from true [2023-11-19 05:15:56,559 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from false [2023-11-19 05:15:58,562 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from true [2023-11-19 05:15:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 15 not checked. [2023-11-19 05:15:58,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:15:58,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| c_func_to_recursive_line_20_to_21_0_~b.base v_ArrVal_216) c_func_to_recursive_line_20_to_21_0_~a.base) c_func_to_recursive_line_20_to_21_0_~a.offset)))) is different from false [2023-11-19 05:15:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912139274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:15:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875838028] [2023-11-19 05:15:58,922 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-19 05:15:58,922 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:15:58,923 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:96) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:15:58,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:15:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 13 [2023-11-19 05:15:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531833490] [2023-11-19 05:15:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:15:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 05:15:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 05:15:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=7, NotChecked=108, Total=306 [2023-11-19 05:15:58,928 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 05:16:01,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse0) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse3))))))) is different from false [2023-11-19 05:16:03,038 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_17| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_17| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_17| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_17| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse0) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse3))))))) is different from true [2023-11-19 05:16:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:03,101 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2023-11-19 05:16:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:16:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2023-11-19 05:16:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:03,103 INFO L225 Difference]: With dead ends: 40 [2023-11-19 05:16:03,103 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 05:16:03,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=75, Invalid=242, Unknown=9, NotChecked=180, Total=506 [2023-11-19 05:16:03,105 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:03,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2023-11-19 05:16:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 05:16:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-19 05:16:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-19 05:16:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-11-19 05:16:03,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 53 [2023-11-19 05:16:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:03,116 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-11-19 05:16:03,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 05:16:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-11-19 05:16:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-19 05:16:03,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:03,120 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:03,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:03,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9005eedb-7867-411e-b4f6-92f33bcb97a3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:03,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 05:16:03,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1413683122, now seen corresponding path program 1 times [2023-11-19 05:16:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738054587] [2023-11-19 05:16:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat