./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/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_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:19:28,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:19:28,246 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:19:28,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:19:28,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:19:28,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:19:28,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:19:28,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:19:28,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:19:28,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:19:28,295 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:19:28,296 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:19:28,297 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:19:28,297 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:19:28,298 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:19:28,299 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:19:28,299 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:19:28,300 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:19:28,300 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:19:28,301 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:19:28,302 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:19:28,305 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:19:28,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:19:28,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:19:28,307 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:19:28,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:19:28,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:19:28,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:19:28,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:19:28,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:19:28,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:19:28,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:19:28,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:19:28,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:19:28,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:19:28,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:19:28,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:19:28,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:19:28,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:19:28,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:19:28,335 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:19:28,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:19:28,336 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:19:28,337 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:19:28,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:19:28,338 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_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/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_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-19 05:19:28,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:19:28,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:19:28,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:19:28,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:19:28,668 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:19:28,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 05:19:31,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:19:32,088 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:19:32,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 05:19:32,101 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/data/c4b71044e/4a0ab9e72bf741bdb47d05cd6a5988fe/FLAG5587cb1a4 [2023-11-19 05:19:32,123 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/data/c4b71044e/4a0ab9e72bf741bdb47d05cd6a5988fe [2023-11-19 05:19:32,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:19:32,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:19:32,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:19:32,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:19:32,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:19:32,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dfdc2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32, skipping insertion in model container [2023-11-19 05:19:32,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,175 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:19:32,395 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-19 05:19:32,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:19:32,414 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:19:32,444 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2023-11-19 05:19:32,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:19:32,468 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:19:32,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32 WrapperNode [2023-11-19 05:19:32,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:19:32,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:19:32,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:19:32,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:19:32,480 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:19:32" (1/1) ... [2023-11-19 05:19:32,490 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:19:32" (1/1) ... [2023-11-19 05:19:32,510 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-11-19 05:19:32,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:19:32,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:19:32,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:19:32,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:19:32,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:19:32,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:19:32,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:19:32,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:19:32,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (1/1) ... [2023-11-19 05:19:32,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:19:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:19:32,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/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:19:32,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/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:19:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:19:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:19:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:19:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:19:32,646 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 05:19:32,646 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 05:19:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 05:19:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 05:19:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:19:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:19:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:19:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 05:19:32,650 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 05:19:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:19:32,726 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:19:32,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:19:32,927 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:19:32,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:19:32,984 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:19:32,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:32 BoogieIcfgContainer [2023-11-19 05:19:32,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:19:32,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:19:32,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:19:32,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:19:32,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:19:32" (1/3) ... [2023-11-19 05:19:32,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82cbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:32, skipping insertion in model container [2023-11-19 05:19:33,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:32" (2/3) ... [2023-11-19 05:19:33,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82cbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:33, skipping insertion in model container [2023-11-19 05:19:33,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:32" (3/3) ... [2023-11-19 05:19:33,001 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-19 05:19:33,034 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:19:33,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:19:33,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:19:33,111 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;@19f71c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:19:33,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:19:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:19:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:19:33,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:33,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:33,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:33,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1151432377, now seen corresponding path program 1 times [2023-11-19 05:19:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239678315] [2023-11-19 05:19:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:33,774 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:19:33,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:33,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239678315] [2023-11-19 05:19:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239678315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:19:33,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:19:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:19:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74994893] [2023-11-19 05:19:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:19:33,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:19:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:19:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:19:33,832 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:19:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:34,030 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-19 05:19:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:19:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-11-19 05:19:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:34,044 INFO L225 Difference]: With dead ends: 39 [2023-11-19 05:19:34,044 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 05:19:34,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:19:34,053 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:34,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:19:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 05:19:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-11-19 05:19:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-19 05:19:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-19 05:19:34,106 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2023-11-19 05:19:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:34,107 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-19 05:19:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:19:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-19 05:19:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:19:34,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:34,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:34,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:19:34,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:34,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -808235070, now seen corresponding path program 1 times [2023-11-19 05:19:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356342216] [2023-11-19 05:19:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:19:34,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356342216] [2023-11-19 05:19:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356342216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:19:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:19:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:19:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928209427] [2023-11-19 05:19:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:19:34,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:19:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:19:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:19:34,577 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:19:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:34,722 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-11-19 05:19:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:19:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2023-11-19 05:19:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:34,725 INFO L225 Difference]: With dead ends: 56 [2023-11-19 05:19:34,726 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 05:19:34,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:19:34,738 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:34,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:19:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 05:19:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-19 05:19:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 05:19:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-19 05:19:34,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2023-11-19 05:19:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-19 05:19:34,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:19:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-19 05:19:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 05:19:34,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:34,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:34,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:19:34,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:34,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1443235882, now seen corresponding path program 1 times [2023-11-19 05:19:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213940744] [2023-11-19 05:19:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:19:34,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213940744] [2023-11-19 05:19:34,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213940744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:19:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:19:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:19:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53321124] [2023-11-19 05:19:34,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:19:34,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:19:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:34,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:19:35,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:19:35,000 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 05:19:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:35,078 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2023-11-19 05:19:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:19:35,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2023-11-19 05:19:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:35,080 INFO L225 Difference]: With dead ends: 58 [2023-11-19 05:19:35,080 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 05:19:35,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:19:35,082 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:35,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:19:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 05:19:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-19 05:19:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-19 05:19:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-19 05:19:35,090 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 31 [2023-11-19 05:19:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:35,091 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-19 05:19:35,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 05:19:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-19 05:19:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 05:19:35,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:35,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:35,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:19:35,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:35,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1079350702, now seen corresponding path program 1 times [2023-11-19 05:19:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173302036] [2023-11-19 05:19:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:19:35,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173302036] [2023-11-19 05:19:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173302036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:19:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514786222] [2023-11-19 05:19:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:19:35,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:19:35,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:19:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:35,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 05:19:35,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:19:35,733 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 15 treesize of output 1 [2023-11-19 05:19:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:19:35,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:19:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:19:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514786222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:19:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125533884] [2023-11-19 05:19:36,665 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-19 05:19:36,665 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:19:36,669 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java: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:19:36,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:19:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-19 05:19:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495047152] [2023-11-19 05:19:36,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:19:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-19 05:19:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 05:19:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-19 05:19:36,674 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-19 05:19:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:36,971 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2023-11-19 05:19:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:19:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 36 [2023-11-19 05:19:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:36,973 INFO L225 Difference]: With dead ends: 64 [2023-11-19 05:19:36,973 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 05:19:36,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2023-11-19 05:19:36,976 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:36,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:19:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 05:19:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-19 05:19:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-19 05:19:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-19 05:19:36,984 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2023-11-19 05:19:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:36,985 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-19 05:19:36,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-19 05:19:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-19 05:19:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 05:19:36,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:36,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:37,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:19:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:37,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:37,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1508132862, now seen corresponding path program 2 times [2023-11-19 05:19:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83488943] [2023-11-19 05:19:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 05:19:38,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83488943] [2023-11-19 05:19:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83488943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:19:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110504681] [2023-11-19 05:19:38,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:19:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:19:38,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:19:38,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:19:38,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-19 05:19:38,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:19:38,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-19 05:19:38,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:19:38,289 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 15 treesize of output 1 [2023-11-19 05:19:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 05:19:38,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:19:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:19:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110504681] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:19:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1881748291] [2023-11-19 05:19:40,672 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-19 05:19:40,672 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:19:40,673 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:19:40,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:19:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 36 [2023-11-19 05:19:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227355215] [2023-11-19 05:19:40,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:19:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-19 05:19:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-19 05:19:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2023-11-19 05:19:40,678 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-19 05:19:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:41,264 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-11-19 05:19:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:19:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 46 [2023-11-19 05:19:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:41,266 INFO L225 Difference]: With dead ends: 72 [2023-11-19 05:19:41,266 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:19:41,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2023-11-19 05:19:41,270 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:41,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 152 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:19:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:19:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 05:19:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-19 05:19:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-11-19 05:19:41,280 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 46 [2023-11-19 05:19:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:41,280 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-11-19 05:19:41,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 2.0) internal successors, (52), 31 states have internal predecessors, (52), 13 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-19 05:19:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-11-19 05:19:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 05:19:41,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:41,283 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:41,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:19:41,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:41,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:41,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash 466624598, now seen corresponding path program 3 times [2023-11-19 05:19:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55633920] [2023-11-19 05:19:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-19 05:19:42,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55633920] [2023-11-19 05:19:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55633920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:19:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684852665] [2023-11-19 05:19:42,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:19:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:19:42,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:19:42,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:19:42,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:19:42,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:19:42,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-19 05:19:42,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:19:42,762 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 15 treesize of output 1 [2023-11-19 05:19:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 05:19:43,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:19:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:19:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684852665] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:19:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097675117] [2023-11-19 05:19:46,598 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-19 05:19:46,598 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:19:46,599 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java: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:19:46,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:19:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 26] total 44 [2023-11-19 05:19:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349681553] [2023-11-19 05:19:46,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:19:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-19 05:19:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:19:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-19 05:19:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2023-11-19 05:19:46,603 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-19 05:19:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:19:47,341 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2023-11-19 05:19:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 05:19:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 56 [2023-11-19 05:19:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:19:47,343 INFO L225 Difference]: With dead ends: 78 [2023-11-19 05:19:47,344 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 05:19:47,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=522, Invalid=2340, Unknown=0, NotChecked=0, Total=2862 [2023-11-19 05:19:47,347 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:19:47,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 238 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:19:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 05:19:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 05:19:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-19 05:19:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-19 05:19:47,356 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 56 [2023-11-19 05:19:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:19:47,357 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-19 05:19:47,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 37 states have internal predecessors, (57), 13 states have call successors, (17), 9 states have call predecessors, (17), 15 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2023-11-19 05:19:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-19 05:19:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-19 05:19:47,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:19:47,359 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:19:47,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:19:47,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:19:47,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:19:47,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:19:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash -340935598, now seen corresponding path program 4 times [2023-11-19 05:19:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:19:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276357807] [2023-11-19 05:19:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:19:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:19:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-19 05:19:52,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:19:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276357807] [2023-11-19 05:19:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276357807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:19:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718790787] [2023-11-19 05:19:52,246 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:19:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:19:52,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:19:52,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:19:52,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:19:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:19:52,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-19 05:19:52,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:19:52,447 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 18 treesize of output 16 [2023-11-19 05:19:52,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:19:54,792 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (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_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-19 05:19:56,799 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (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_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-19 05:19:58,857 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) is different from false [2023-11-19 05:20:00,859 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) is different from true [2023-11-19 05:20:03,007 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-19 05:20:03,010 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-19 05:20:03,055 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |v_#memory_int_474| .cse0)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|)))) is different from false [2023-11-19 05:20:03,059 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_31| .cse0))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse0 (select |v_#memory_int_474| .cse0)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|)))) is different from true [2023-11-19 05:20:03,137 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2023-11-19 05:20:03,141 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2023-11-19 05:20:03,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2023-11-19 05:20:07,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:20:07,858 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 28 treesize of output 23 [2023-11-19 05:20:07,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:20:07,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-19 05:20:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 69 trivial. 13 not checked. [2023-11-19 05:20:07,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:20:09,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#b~0#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_339 Int) (v_func_to_recursive_line_22_to_23_0_~c.base_80 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset| v_ArrVal_339)) v_func_to_recursive_line_22_to_23_0_~c.base_80 v_ArrVal_340) |c_ULTIMATE.start_main_~#b~0#1.base|))) (let ((.cse1 (select .cse0 |ULTIMATE.start_main_~#b~0#1.offset|))) (or (< (select (select (store (store |c_#memory_int| v_func_to_recursive_line_22_to_23_0_~c.base_80 v_ArrVal_340) |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse0 |ULTIMATE.start_main_~#b~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 5) (< .cse1 5) (< 0 v_ArrVal_339))))) is different from false [2023-11-19 05:20:09,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718790787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:20:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1108933287] [2023-11-19 05:20:09,290 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-11-19 05:20:09,290 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:20:09,291 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:20:09,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:20:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 33 [2023-11-19 05:20:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095886042] [2023-11-19 05:20:09,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:20:09,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-19 05:20:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:20:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-19 05:20:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=667, Unknown=13, NotChecked=342, Total=1122 [2023-11-19 05:20:09,300 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-19 05:20:15,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (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_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-19 05:20:15,161 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (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_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_27| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_27| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_27| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_27| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_old(#memory_int)_AFTER_CALL_27|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-19 05:20:17,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) .cse0 (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse1 (select |c_#memory_int| .cse1))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_31| .cse1))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and .cse0 (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from false [2023-11-19 05:20:17,255 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) .cse0 (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_31| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_31| .cse1 (select |c_#memory_int| .cse1))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse1 (select |v_old(#memory_int)_AFTER_CALL_31| .cse1))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and .cse0 (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from true [2023-11-19 05:20:17,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base))) (and .cse0 .cse1 (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse5 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (or (< (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 6) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (and (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 0)) .cse0 .cse1)))) is different from false [2023-11-19 05:20:17,293 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base))) (and .cse0 .cse1 (or (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select |v_#memory_int_474| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse5 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse5 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))) |c_#memory_int|))) (or (< (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 6) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (and (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 0)) .cse0 .cse1)))) is different from true [2023-11-19 05:20:17,307 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 0)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2023-11-19 05:20:17,317 WARN L876 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 0)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_1))) (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_474| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_31| |v_#memory_int_474|))) (and (= |v_old(#memory_int)_AFTER_CALL_31| (store |c_old(#memory_int)| .cse2 (select |v_old(#memory_int)_AFTER_CALL_31| .cse2))) (= (store |v_old(#memory_int)_AFTER_CALL_31| .cse2 (select |v_#memory_int_474| .cse2)) |v_#memory_int_474|)))) (= |c_#memory_int| (store |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_474| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2023-11-19 05:20:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:20:19,095 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-19 05:20:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-19 05:20:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 61 [2023-11-19 05:20:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:20:19,098 INFO L225 Difference]: With dead ends: 55 [2023-11-19 05:20:19,098 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 05:20:19,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=182, Invalid=1318, Unknown=22, NotChecked=830, Total=2352 [2023-11-19 05:20:19,101 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:20:19,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 178 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 527 Invalid, 1 Unknown, 461 Unchecked, 2.2s Time] [2023-11-19 05:20:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 05:20:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 05:20:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-19 05:20:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-19 05:20:19,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 61 [2023-11-19 05:20:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:20:19,112 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-19 05:20:19,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-19 05:20:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-19 05:20:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-19 05:20:19,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:20:19,114 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:20:19,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 05:20:19,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfba2f91-b7e2-436d-b02f-f3eb6391d6e2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 05:20:19,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:20:19,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:20:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash 816427588, now seen corresponding path program 5 times [2023-11-19 05:20:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:20:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206667469] [2023-11-19 05:20:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:20:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:20:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat