./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91 --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 fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:08:43,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:08:43,494 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:08:43,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:08:43,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:08:43,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:08:43,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:08:43,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:08:43,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:08:43,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:08:43,553 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:08:43,554 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:08:43,554 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:08:43,556 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:08:43,557 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:08:43,557 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:08:43,557 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:08:43,558 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:08:43,558 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:08:43,559 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:08:43,559 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:08:43,560 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:08:43,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:08:43,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:08:43,562 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:08:43,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:08:43,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:08:43,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:08:43,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:08:43,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:08:43,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:08:43,565 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:08:43,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:08:43,566 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:08:43,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:08:43,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:08:43,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:08:43,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:08:43,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:08:43,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:08:43,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:08:43,568 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:08:43,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:08:43,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:08:43,569 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:08:43,569 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:08:43,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:08:43,570 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_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/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_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91 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 -> fab3df42fb7f885fd39a281a051af0420a7d494ced4f3c2e06236facb6a7ec78 [2023-11-25 00:08:43,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:08:43,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:08:43,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:08:43,968 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:08:43,969 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:08:43,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-25 00:08:47,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:08:47,370 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:08:47,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c [2023-11-25 00:08:47,378 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/data/a44e44a25/fbaaca5731b7455290190a00e0d198f5/FLAG9fe2d47a1 [2023-11-25 00:08:47,393 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/data/a44e44a25/fbaaca5731b7455290190a00e0d198f5 [2023-11-25 00:08:47,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:08:47,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:08:47,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:47,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:08:47,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:08:47,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abbb5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47, skipping insertion in model container [2023-11-25 00:08:47,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:08:47,594 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_808c9662-5408-470b-9238-eada44dad22a/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-25 00:08:47,600 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_808c9662-5408-470b-9238-eada44dad22a/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-25 00:08:47,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:47,611 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:08:47,629 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_808c9662-5408-470b-9238-eada44dad22a/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1474,1487] [2023-11-25 00:08:47,630 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_808c9662-5408-470b-9238-eada44dad22a/sv-benchmarks/c/recursified_loop-invariants/recursified_linear-inequality-inv-a.c[1547,1560] [2023-11-25 00:08:47,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:47,647 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:08:47,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47 WrapperNode [2023-11-25 00:08:47,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:47,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:47,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:08:47,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:08:47,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,685 INFO L138 Inliner]: procedures = 13, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2023-11-25 00:08:47,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:47,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:08:47,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:08:47,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:08:47,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:08:47,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:08:47,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:08:47,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:08:47,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (1/1) ... [2023-11-25 00:08:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:08:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:47,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:08:47,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:08:47,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:08:47,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:08:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:08:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_15_0 [2023-11-25 00:08:47,816 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_15_0 [2023-11-25 00:08:47,890 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:08:47,893 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:08:48,063 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:08:48,086 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:08:48,086 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:08:48,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:48 BoogieIcfgContainer [2023-11-25 00:08:48,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:08:48,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:08:48,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:08:48,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:08:48,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:08:47" (1/3) ... [2023-11-25 00:08:48,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b87b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:48, skipping insertion in model container [2023-11-25 00:08:48,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:47" (2/3) ... [2023-11-25 00:08:48,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b87b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:48, skipping insertion in model container [2023-11-25 00:08:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:48" (3/3) ... [2023-11-25 00:08:48,100 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_linear-inequality-inv-a.c [2023-11-25 00:08:48,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:08:48,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-25 00:08:48,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:08:48,184 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;@68dbf14e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:08:48,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-25 00:08:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-25 00:08:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:08:48,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:48,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:48,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:48,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 947785726, now seen corresponding path program 1 times [2023-11-25 00:08:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425594188] [2023-11-25 00:08:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:49,033 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-25 00:08:49,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425594188] [2023-11-25 00:08:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425594188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:08:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42364831] [2023-11-25 00:08:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:49,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:08:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:08:49,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:08:49,095 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-25 00:08:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:49,274 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-25 00:08:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:08:49,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-25 00:08:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:49,285 INFO L225 Difference]: With dead ends: 28 [2023-11-25 00:08:49,286 INFO L226 Difference]: Without dead ends: 22 [2023-11-25 00:08:49,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:49,292 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:49,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-25 00:08:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-25 00:08:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:08:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-25 00:08:49,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2023-11-25 00:08:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:49,345 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-25 00:08:49,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-25 00:08:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-25 00:08:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:08:49,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:49,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:08:49,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:49,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash -683409516, now seen corresponding path program 1 times [2023-11-25 00:08:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:49,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349451467] [2023-11-25 00:08:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:49,673 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-25 00:08:49,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349451467] [2023-11-25 00:08:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349451467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:49,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:08:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035006603] [2023-11-25 00:08:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:49,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:49,685 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-25 00:08:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:49,798 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-11-25 00:08:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:08:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2023-11-25 00:08:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:49,800 INFO L225 Difference]: With dead ends: 22 [2023-11-25 00:08:49,800 INFO L226 Difference]: Without dead ends: 17 [2023-11-25 00:08:49,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:08:49,803 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:49,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-25 00:08:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-25 00:08:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:08:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-25 00:08:49,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2023-11-25 00:08:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:49,811 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-25 00:08:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-25 00:08:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-11-25 00:08:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-25 00:08:49,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:49,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:49,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:08:49,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:49,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1341401249, now seen corresponding path program 1 times [2023-11-25 00:08:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419346150] [2023-11-25 00:08:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:08:51,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419346150] [2023-11-25 00:08:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419346150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76239030] [2023-11-25 00:08:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:51,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:51,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:51,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:08:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:51,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-25 00:08:51,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:51,324 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:08:51,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:08:51,490 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_1 Int) (v_y_1 Int)) (and (<= v_z_1 255) (<= 0 v_z_1) (= |c_#memory_int| (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_1) v_z_1))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_1))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))))) is different from true [2023-11-25 00:08:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:51,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2023-11-25 00:08:51,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-11-25 00:08:51,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2023-11-25 00:08:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-25 00:08:51,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76239030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:52,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [555653903] [2023-11-25 00:08:52,591 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-25 00:08:52,592 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:52,596 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-25 00:08:52,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:08:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-25 00:08:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133284472] [2023-11-25 00:08:52,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:52,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-25 00:08:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-25 00:08:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2023-11-25 00:08:52,603 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-25 00:08:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:53,143 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-25 00:08:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:08:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-11-25 00:08:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:53,147 INFO L225 Difference]: With dead ends: 30 [2023-11-25 00:08:53,147 INFO L226 Difference]: Without dead ends: 26 [2023-11-25 00:08:53,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2023-11-25 00:08:53,149 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:53,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2023-11-25 00:08:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-25 00:08:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-11-25 00:08:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:08:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-25 00:08:53,163 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-11-25 00:08:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:53,163 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-25 00:08:53,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-25 00:08:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-25 00:08:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-25 00:08:53,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:53,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:53,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:53,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:53,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1366238291, now seen corresponding path program 1 times [2023-11-25 00:08:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931240624] [2023-11-25 00:08:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:08:54,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931240624] [2023-11-25 00:08:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931240624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024762295] [2023-11-25 00:08:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:54,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:54,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:54,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:08:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:54,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-25 00:08:54,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:54,230 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:08:54,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-25 00:08:54,331 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_3 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_y_3 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset (+ v_z_3 (* 256 v_y_3)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_3))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_3) (<= v_z_3 255))) is different from true [2023-11-25 00:08:54,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:54,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2023-11-25 00:08:54,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-25 00:08:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-11-25 00:08:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-25 00:08:54,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024762295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176928607] [2023-11-25 00:08:54,939 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-25 00:08:54,939 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:54,939 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-25 00:08:54,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:08:54,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-11-25 00:08:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649564861] [2023-11-25 00:08:54,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-25 00:08:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-25 00:08:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2023-11-25 00:08:54,942 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-25 00:08:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:55,283 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-11-25 00:08:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:08:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2023-11-25 00:08:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:55,287 INFO L225 Difference]: With dead ends: 26 [2023-11-25 00:08:55,287 INFO L226 Difference]: Without dead ends: 21 [2023-11-25 00:08:55,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=305, Unknown=1, NotChecked=36, Total=420 [2023-11-25 00:08:55,289 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:55,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2023-11-25 00:08:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-25 00:08:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-25 00:08:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:08:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-11-25 00:08:55,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2023-11-25 00:08:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:55,298 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-11-25 00:08:55,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-25 00:08:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-11-25 00:08:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-25 00:08:55,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:55,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:55,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:55,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:55,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:55,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2114283542, now seen corresponding path program 2 times [2023-11-25 00:08:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556811775] [2023-11-25 00:08:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:08:56,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556811775] [2023-11-25 00:08:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556811775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102258619] [2023-11-25 00:08:56,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:08:56,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:56,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:56,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:56,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:08:57,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-25 00:08:57,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:08:57,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-25 00:08:57,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:57,347 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:08:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:08:57,784 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_6 Int) (v_z_6 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_6) (<= v_z_6 255))) is different from true [2023-11-25 00:08:57,866 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_z_5 Int) (v_y_6 Int) (v_y_5 Int) (v_z_6 Int)) (and (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* 256 v_y_5) v_z_5))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_5 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_6 (* 256 v_y_6))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_1) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_6 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_5) (<= 0 v_z_6) (<= v_z_6 255) (<= v_z_5 255))) is different from true [2023-11-25 00:08:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:57,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:57,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2023-11-25 00:08:57,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:08:58,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:58,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:58,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:58,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2023-11-25 00:08:58,198 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2023-11-25 00:08:58,204 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 42 treesize of output 32 [2023-11-25 00:08:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2023-11-25 00:08:58,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102258619] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:59,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1156414589] [2023-11-25 00:08:59,466 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-25 00:08:59,466 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:59,467 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-25 00:08:59,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:08:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-11-25 00:08:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247751929] [2023-11-25 00:08:59,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:59,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-25 00:08:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-25 00:08:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=396, Unknown=4, NotChecked=82, Total=552 [2023-11-25 00:08:59,469 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:09:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:03,465 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-25 00:09:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:09:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 20 [2023-11-25 00:09:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:03,467 INFO L225 Difference]: With dead ends: 30 [2023-11-25 00:09:03,467 INFO L226 Difference]: Without dead ends: 28 [2023-11-25 00:09:03,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=8, NotChecked=106, Total=870 [2023-11-25 00:09:03,469 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:03,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 76 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 1 Unknown, 54 Unchecked, 0.3s Time] [2023-11-25 00:09:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-25 00:09:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-11-25 00:09:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-25 00:09:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-11-25 00:09:03,480 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2023-11-25 00:09:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:03,480 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-11-25 00:09:03,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:09:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-11-25 00:09:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:09:03,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:03,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:03,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-25 00:09:03,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:03,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:03,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1118284412, now seen corresponding path program 2 times [2023-11-25 00:09:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:03,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158968715] [2023-11-25 00:09:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:09:04,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158968715] [2023-11-25 00:09:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158968715] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:04,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074639479] [2023-11-25 00:09:04,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:09:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:04,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:04,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:09:05,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-25 00:09:05,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:09:05,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-25 00:09:05,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:05,132 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:09:05,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:09:05,517 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_11 Int) (v_y_11 Int)) (and (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_11 (* v_y_11 256)))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= 0 v_z_11) (<= v_z_11 255))) is different from true [2023-11-25 00:09:05,604 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_z_10 Int) (v_y_10 Int) (v_z_11 Int) (v_y_11 Int)) (and (<= 0 v_z_10) (<= 0 v_z_11) (<= v_z_11 255) (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_10 (* v_y_10 256)))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_10))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_5) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_11 (* v_y_11 256))))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_5) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_11 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_10 255))) is different from true [2023-11-25 00:09:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:05,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:05,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2023-11-25 00:09:05,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:09:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:06,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:06,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2023-11-25 00:09:06,087 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 37 treesize of output 29 [2023-11-25 00:09:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2023-11-25 00:09:06,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074639479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395130883] [2023-11-25 00:09:06,993 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-25 00:09:06,994 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:06,994 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java: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-25 00:09:06,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:09:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2023-11-25 00:09:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563993255] [2023-11-25 00:09:06,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:09:06,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-25 00:09:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-25 00:09:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=377, Unknown=4, NotChecked=82, Total=552 [2023-11-25 00:09:06,996 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:09:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:09,820 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-25 00:09:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:09:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-11-25 00:09:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:09,822 INFO L225 Difference]: With dead ends: 28 [2023-11-25 00:09:09,823 INFO L226 Difference]: Without dead ends: 23 [2023-11-25 00:09:09,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=109, Invalid=495, Unknown=4, NotChecked=94, Total=702 [2023-11-25 00:09:09,826 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:09,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 4 Unknown, 46 Unchecked, 0.3s Time] [2023-11-25 00:09:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-25 00:09:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-25 00:09:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-25 00:09:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-11-25 00:09:09,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2023-11-25 00:09:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:09,836 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-11-25 00:09:09,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:09:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-11-25 00:09:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:09:09,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:09,838 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:09,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:09:10,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:10,046 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:10,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -442591433, now seen corresponding path program 3 times [2023-11-25 00:09:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336616050] [2023-11-25 00:09:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-25 00:09:12,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336616050] [2023-11-25 00:09:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336616050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537434827] [2023-11-25 00:09:12,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:09:12,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:12,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:12,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:09:12,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:09:12,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:09:12,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 100 conjunts are in the unsatisfiable core [2023-11-25 00:09:12,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:12,321 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:09:12,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:09:12,717 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_17 Int) (v_z_17 Int)) (and (<= 0 v_z_17) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_17 255))) is different from true [2023-11-25 00:09:12,809 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_16 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_y_16 Int) (v_y_17 Int) (v_z_17 Int)) (and (<= 0 v_z_17) (<= v_z_17 255) (<= v_z_16 255) (<= 0 v_z_16) (= (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256)))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_16))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_10) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_10) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|))) is different from true [2023-11-25 00:09:12,944 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_16 Int) (v_z_15 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_y_16 Int) (v_ArrVal_286 Int) (v_y_17 Int) (v_z_17 Int) (v_ArrVal_289 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (and (<= 0 v_z_17) (<= v_z_17 255) (= (store (let ((.cse6 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_289))) (let ((.cse5 (store (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_15 (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_286)) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|))))) (let ((.cse3 (store (select (store (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_11) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_16 (* v_y_16 256))))) (let ((.cse2 (let ((.cse4 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_11) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_16 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_10) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_17 256) v_z_17)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_10) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_17 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|) (<= v_z_16 255) (<= 0 v_z_15) (<= 0 v_z_16) (<= v_z_15 255))) is different from true [2023-11-25 00:09:13,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:13,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:13,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2023-11-25 00:09:13,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-25 00:09:13,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-25 00:09:13,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-25 00:09:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2023-11-25 00:09:13,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537434827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1179189065] [2023-11-25 00:09:14,960 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-25 00:09:14,960 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:14,961 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-25 00:09:14,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:09:14,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2023-11-25 00:09:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348456773] [2023-11-25 00:09:14,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:09:14,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:09:14,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:09:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=470, Unknown=8, NotChecked=138, Total=702 [2023-11-25 00:09:14,967 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:09:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:16,407 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-11-25 00:09:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:09:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 25 [2023-11-25 00:09:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:16,409 INFO L225 Difference]: With dead ends: 32 [2023-11-25 00:09:16,409 INFO L226 Difference]: Without dead ends: 30 [2023-11-25 00:09:16,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=130, Invalid=739, Unknown=13, NotChecked=174, Total=1056 [2023-11-25 00:09:16,411 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:16,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 94 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 4 Unknown, 85 Unchecked, 0.5s Time] [2023-11-25 00:09:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-25 00:09:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-11-25 00:09:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-25 00:09:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-11-25 00:09:16,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2023-11-25 00:09:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:16,420 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-25 00:09:16,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:09:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-11-25 00:09:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:09:16,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:16,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:16,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:09:16,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-25 00:09:16,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:16,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash -835428485, now seen corresponding path program 3 times [2023-11-25 00:09:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789285439] [2023-11-25 00:09:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-25 00:09:17,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789285439] [2023-11-25 00:09:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789285439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130105618] [2023-11-25 00:09:17,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:09:17,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:17,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:17,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:09:18,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:09:18,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:09:18,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-25 00:09:18,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:18,106 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:09:18,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:09:18,417 WARN L876 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_12_to_15_0_~v.offset Int) (v_z_26 Int) (v_ArrVal_392 Int)) (and (<= v_z_26 255) (<= 0 v_z_26) (= (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset v_ArrVal_392)))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_26))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|))) is different from true [2023-11-25 00:09:18,518 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_25 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_func_to_recursive_line_12_to_15_0_~v.offset_55 Int) (v_y_25 Int) (v_z_26 Int) (v_ArrVal_392 Int) (v_DerPreprocessor_12 (Array Int Int))) (and (= |c_#memory_int| (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) v_func_to_recursive_line_12_to_15_0_~v.offset_55 (+ v_z_25 (* v_y_25 256)))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_25 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_12) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset v_ArrVal_392))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_12) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_26))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (<= 0 v_z_25) (<= v_z_26 255) (<= 0 v_z_26) (<= v_z_25 255))) is different from true [2023-11-25 00:09:18,637 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_25 Int) (func_to_recursive_line_12_to_15_0_~v.offset Int) (v_z_24 Int) (v_func_to_recursive_line_12_to_15_0_~v.offset_55 Int) (v_y_25 Int) (v_func_to_recursive_line_12_to_15_0_~v.offset_56 Int) (v_z_26 Int) (v_ArrVal_384 Int) (v_ArrVal_392 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (and (<= 0 v_z_25) (<= v_z_26 255) (<= 0 v_z_26) (<= 0 v_z_24) (<= v_z_24 255) (<= v_z_25 255) (= |c_#memory_int| (store (let ((.cse6 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) func_to_recursive_line_12_to_15_0_~v.offset v_ArrVal_384)))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_24))))) (let ((.cse3 (store (select (store (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_13) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) v_func_to_recursive_line_12_to_15_0_~v.offset_55 (+ v_z_25 (* v_y_25 256))))) (let ((.cse2 (let ((.cse4 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_13) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_25 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_12) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) v_func_to_recursive_line_12_to_15_0_~v.offset_56 v_ArrVal_392))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_12) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_26 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))))) is different from true [2023-11-25 00:09:18,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:18,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2023-11-25 00:09:18,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2023-11-25 00:09:18,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:18,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2023-11-25 00:09:18,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-25 00:09:18,784 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-25 00:09:18,800 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:09:18,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-25 00:09:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2023-11-25 00:09:18,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130105618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [392567937] [2023-11-25 00:09:20,749 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-25 00:09:20,749 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:20,750 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-25 00:09:20,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:09:20,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2023-11-25 00:09:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924737674] [2023-11-25 00:09:20,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:09:20,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:09:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:09:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=444, Unknown=3, NotChecked=138, Total=702 [2023-11-25 00:09:20,754 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:09:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:31,667 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-25 00:09:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:09:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 26 [2023-11-25 00:09:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:31,669 INFO L225 Difference]: With dead ends: 30 [2023-11-25 00:09:31,669 INFO L226 Difference]: Without dead ends: 25 [2023-11-25 00:09:31,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=149, Invalid=667, Unknown=8, NotChecked=168, Total=992 [2023-11-25 00:09:31,671 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 64 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2023-11-25 00:09:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-25 00:09:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-25 00:09:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-25 00:09:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-11-25 00:09:31,678 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 26 [2023-11-25 00:09:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:31,679 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-11-25 00:09:31,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-25 00:09:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-11-25 00:09:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:09:31,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:31,680 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:31,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-25 00:09:31,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:31,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:31,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2069291986, now seen corresponding path program 4 times [2023-11-25 00:09:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120381629] [2023-11-25 00:09:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-25 00:09:34,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120381629] [2023-11-25 00:09:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120381629] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259002836] [2023-11-25 00:09:34,244 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-25 00:09:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:34,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:34,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808c9662-5408-470b-9238-eada44dad22a/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:09:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:34,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-25 00:09:34,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:34,732 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:09:34,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-25 00:09:35,430 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_36 Int) (v_y_36 Int)) (and (<= v_z_36 255) (<= 0 v_z_36) (= |c_#memory_int| (store (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_36 256) v_z_36))))) (store .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_36 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))))) is different from true [2023-11-25 00:09:35,535 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_36 Int) (v_y_35 Int) (v_z_35 Int) (v_y_36 Int) (v_DerPreprocessor_16 (Array Int Int))) (and (<= v_z_36 255) (<= 0 v_z_35) (<= v_z_35 255) (<= 0 v_z_36) (= |c_#memory_int| (store (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_35 256) v_z_35))))) (let ((.cse2 (let ((.cse4 (select .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_35 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store .cse3 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_36 256) v_z_36)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_36 (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))))) is different from true [2023-11-25 00:09:35,701 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_34 Int) (v_z_36 Int) (v_y_35 Int) (v_z_35 Int) (v_y_36 Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_z_34 Int)) (and (<= v_z_36 255) (<= 0 v_z_35) (<= v_z_35 255) (<= 0 v_z_36) (<= 0 v_z_34) (<= v_z_34 255) (= (store (let ((.cse6 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_34 (* v_y_34 256)))))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_34 (select .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse3 (store (select (store (store .cse6 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_17) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_35 256) v_z_35)))) (let ((.cse2 (let ((.cse4 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_17) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ v_z_35 (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|)))))) (let ((.cse0 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_36 256) v_z_36)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_36))))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|)) |c_#memory_int|))) is different from true [2023-11-25 00:09:35,986 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_504 Int) (v_z_34 Int) (v_z_33 Int) (v_y_34 Int) (v_z_36 Int) (v_y_35 Int) (v_z_35 Int) (v_y_36 Int) (v_ArrVal_508 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (<= 0 v_z_33) (<= v_z_36 255) (<= 0 v_z_35) (= |c_#memory_int| (store (let ((.cse9 (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| v_ArrVal_508))) (let ((.cse8 (store (select .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select (select (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| v_ArrVal_504)) |c_func_to_recursive_line_12_to_15_0_#in~s.base|) |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_33)))) (let ((.cse6 (store (select (store (store .cse9 |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse8) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_18) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ v_z_34 (* v_y_34 256))))) (let ((.cse5 (let ((.cse7 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse8) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_18) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse6) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse7 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_34))))) (let ((.cse3 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse6) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_17) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_35 256) v_z_35)))) (let ((.cse2 (let ((.cse4 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse5) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_17) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse4 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_35))))) (let ((.cse0 (store (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse3) |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base|) |c_func_to_recursive_line_12_to_15_0_#in~v.offset| (+ (* v_y_36 256) v_z_36)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base| (let ((.cse1 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_12_to_15_0_#in~s.base| .cse2) |c_func_to_recursive_line_12_to_15_0_#in~i.base| v_DerPreprocessor_16) |c_func_to_recursive_line_12_to_15_0_#in~v.base| .cse0) |c_func_to_recursive_line_12_to_15_0_#in~s.base|))) (store .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset| (+ (select .cse1 |c_func_to_recursive_line_12_to_15_0_#in~s.offset|) v_z_36))))))))))) |c_func_to_recursive_line_12_to_15_0_#in~i.base| (select |c_#memory_int| |c_func_to_recursive_line_12_to_15_0_#in~i.base|))) (<= v_z_33 255) (<= v_z_35 255) (<= 0 v_z_36) (<= 0 v_z_34) (<= v_z_34 255))) is different from true [2023-11-25 00:09:36,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:36,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:36,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:36,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2023-11-25 00:09:36,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-25 00:09:36,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-25 00:09:36,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-25 00:09:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 10 refuted. 1 times theorem prover too weak. 12 trivial. 23 not checked. [2023-11-25 00:09:36,401 INFO L327 TraceCheckSpWp]: Computing backward predicates...