./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:21:07,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:21:07,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:21:07,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:21:07,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:21:07,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:21:07,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:21:07,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:21:07,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:21:07,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:21:07,858 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:21:07,859 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:21:07,860 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:21:07,860 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:21:07,861 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:21:07,862 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:21:07,862 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:21:07,863 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:21:07,863 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:21:07,864 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:21:07,864 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:21:07,865 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:21:07,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:21:07,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:21:07,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:21:07,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:21:07,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:21:07,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:21:07,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:21:07,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:21:07,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:21:07,870 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:21:07,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:21:07,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:21:07,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:21:07,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:21:07,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:21:07,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:21:07,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:21:07,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:21:07,875 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:21:07,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:21:07,876 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:21:07,876 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:21:07,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:21:07,876 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_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 [2023-11-19 05:21:08,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:21:08,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:21:08,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:21:08,310 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:21:08,311 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:21:08,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2023-11-19 05:21:11,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:21:12,040 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:21:12,041 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2023-11-19 05:21:12,051 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/data/f5a7b7ba3/806295def4c54a03b258143d024cdfbc/FLAG54d86d4bd [2023-11-19 05:21:12,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/data/f5a7b7ba3/806295def4c54a03b258143d024cdfbc [2023-11-19 05:21:12,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:21:12,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:21:12,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:21:12,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:21:12,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:21:12,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe92f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12, skipping insertion in model container [2023-11-19 05:21:12,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,138 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:21:12,314 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_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2023-11-19 05:21:12,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:21:12,346 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:21:12,361 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_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2023-11-19 05:21:12,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:21:12,390 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:21:12,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12 WrapperNode [2023-11-19 05:21:12,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:21:12,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:21:12,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:21:12,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:21:12,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,435 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-11-19 05:21:12,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:21:12,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:21:12,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:21:12,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:21:12,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:21:12,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:21:12,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:21:12,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:21:12,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (1/1) ... [2023-11-19 05:21:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:21:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:12,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:21:12,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:21:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:21:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_33_0 [2023-11-19 05:21:12,575 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_33_0 [2023-11-19 05:21:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:21:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:21:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:21:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:21:12,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:21:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:21:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-19 05:21:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-19 05:21:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:21:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_36_to_40_0 [2023-11-19 05:21:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_36_to_40_0 [2023-11-19 05:21:12,725 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:21:12,729 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:21:12,952 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:21:12,980 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:21:12,980 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:21:12,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:21:12 BoogieIcfgContainer [2023-11-19 05:21:12,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:21:12,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:21:12,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:21:12,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:21:12,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:21:12" (1/3) ... [2023-11-19 05:21:12,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe7242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:21:12, skipping insertion in model container [2023-11-19 05:21:12,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:21:12" (2/3) ... [2023-11-19 05:21:12,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe7242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:21:12, skipping insertion in model container [2023-11-19 05:21:13,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:21:12" (3/3) ... [2023-11-19 05:21:13,004 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_1-1.i [2023-11-19 05:21:13,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:21:13,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:21:13,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:21:13,120 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;@312f4c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:21:13,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:21:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:21:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:21:13,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:13,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:13,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:13,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 645586700, now seen corresponding path program 1 times [2023-11-19 05:21:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400499001] [2023-11-19 05:21:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:21:14,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400499001] [2023-11-19 05:21:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400499001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:21:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:21:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:21:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50559098] [2023-11-19 05:21:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:21:14,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:21:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:21:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:21:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:21:14,206 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:21:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:21:14,455 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2023-11-19 05:21:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:21:14,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-19 05:21:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:21:14,469 INFO L225 Difference]: With dead ends: 54 [2023-11-19 05:21:14,469 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 05:21:14,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:21:14,479 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:21:14,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:21:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 05:21:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 05:21:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 05:21:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 05:21:14,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2023-11-19 05:21:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:21:14,553 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 05:21:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:21:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-19 05:21:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:21:14,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:14,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:21:14,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:14,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash 887449598, now seen corresponding path program 1 times [2023-11-19 05:21:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605333325] [2023-11-19 05:21:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:21:15,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605333325] [2023-11-19 05:21:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605333325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:21:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800229584] [2023-11-19 05:21:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:15,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:15,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:21:15,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:21:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:15,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-19 05:21:15,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:21:15,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:21:15,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 05:21:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:21:17,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:21:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800229584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:21:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1074235218] [2023-11-19 05:21:17,601 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:21:17,601 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:21:17,606 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:21:17,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:21:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-19 05:21:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353382606] [2023-11-19 05:21:17,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:21:17,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 05:21:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:21:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 05:21:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:21:17,617 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:21:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:21:20,904 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-11-19 05:21:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:21:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-11-19 05:21:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:21:20,906 INFO L225 Difference]: With dead ends: 47 [2023-11-19 05:21:20,906 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 05:21:20,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-11-19 05:21:20,908 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:21:20,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 45 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-19 05:21:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 05:21:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 05:21:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 05:21:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-19 05:21:20,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2023-11-19 05:21:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:21:20,919 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-19 05:21:20,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:21:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-19 05:21:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:21:20,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:20,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:20,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 05:21:21,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:21,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:21,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1965379784, now seen corresponding path program 2 times [2023-11-19 05:21:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198640411] [2023-11-19 05:21:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 05:21:22,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198640411] [2023-11-19 05:21:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198640411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:21:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169336770] [2023-11-19 05:21:22,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:21:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:22,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:21:22,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:21:22,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 05:21:22,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:21:22,813 WARN L260 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-19 05:21:22,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:21:22,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-19 05:21:22,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:21:24,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:21:24,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2023-11-19 05:21:24,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2023-11-19 05:21:24,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2023-11-19 05:21:24,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-11-19 05:21:24,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:21:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:21:25,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:21:28,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:21:28,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2227 treesize of output 2228 [2023-11-19 05:21:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169336770] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:21:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957060546] [2023-11-19 05:21:30,574 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 05:21:30,575 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:21:30,575 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:21:30,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:21:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2023-11-19 05:21:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897218704] [2023-11-19 05:21:30,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:21:30,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-19 05:21:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:21:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-19 05:21:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2023-11-19 05:21:30,580 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 28 states, 20 states have (on average 1.75) internal successors, (35), 24 states have internal predecessors, (35), 10 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-19 05:21:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:21:38,825 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-11-19 05:21:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:21:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 1.75) internal successors, (35), 24 states have internal predecessors, (35), 10 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 30 [2023-11-19 05:21:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:21:38,828 INFO L225 Difference]: With dead ends: 54 [2023-11-19 05:21:38,828 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 05:21:38,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=172, Invalid=1808, Unknown=0, NotChecked=0, Total=1980 [2023-11-19 05:21:38,831 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:21:38,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 173 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-19 05:21:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 05:21:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-19 05:21:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-19 05:21:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-19 05:21:38,842 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 30 [2023-11-19 05:21:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:21:38,843 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-19 05:21:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 1.75) internal successors, (35), 24 states have internal predecessors, (35), 10 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-19 05:21:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-19 05:21:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 05:21:38,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:21:38,845 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:21:38,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:21:39,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-19 05:21:39,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:21:39,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:21:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1186371296, now seen corresponding path program 3 times [2023-11-19 05:21:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:21:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233956128] [2023-11-19 05:21:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:21:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:21:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:21:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-19 05:21:40,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:21:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233956128] [2023-11-19 05:21:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233956128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:21:40,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702812113] [2023-11-19 05:21:40,631 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:21:40,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:21:40,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:21:40,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:21:40,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecb8b08-a33b-49a9-83ab-b10e5dc5fa6e/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:21:40,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:21:40,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:21:40,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-19 05:21:40,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:21:40,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:21:40,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-19 05:21:51,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (and (<= 1000 (mod (select .cse0 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 4294967296)) (let ((.cse95 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) |c_func_to_recursive_line_32_to_33_0_#in~index.offset|))) (let ((.cse94 (mod .cse95 4294967296)) (.cse10 (select |c_#memory_int| |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse1 (= |c_#memory_int| (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse10) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0))) (.cse68 (<= 2147483648 .cse94)) (.cse16 (select |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse17 (* .cse94 4)) (.cse18 (mod .cse95 2)) (.cse19 (<= .cse94 2147483647))) (or (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_19 Int) (v_prenex_71 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (store .cse16 (+ .cse17 v_prenex_71) .cse18))) (let ((.cse15 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse3) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse14 (+ (select .cse15 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse13 (store .cse15 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse14))) (let ((.cse2 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_14) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse13) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse8 (store .cse2 (+ v_prenex_19 (* 4 (mod .cse14 4294967296))) (mod .cse14 2)))) (let ((.cse12 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse13) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse8) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse11 (+ (select .cse12 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse6 (store .cse12 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse11))) (let ((.cse9 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_1) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse6) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse4 (mod .cse11 4294967296))) (let ((.cse7 (store .cse9 (+ func_to_recursive_line_32_to_33_0_~array.offset (* .cse4 4)) (mod .cse11 2)))) (and (= .cse2 .cse3) (<= .cse4 2147483647) (= (let ((.cse5 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse6) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse7) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse5 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse5 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) .cse0) (= .cse8 .cse9) (= .cse7 .cse10)))))))))))))) .cse19) (and .cse1 (exists ((v_prenex_27 Int) (v_DerPreprocessor_20 (Array Int Int)) (func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_99 Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse23 (store .cse16 (+ .cse17 v_prenex_99) .cse18))) (let ((.cse33 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse23) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse32 (+ (select .cse33 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse31 (store .cse33 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse32))) (let ((.cse22 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_20) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse31) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse20 (mod .cse32 4294967296))) (let ((.cse26 (store .cse22 (+ (* .cse20 4) v_prenex_27) (mod .cse32 2)))) (let ((.cse30 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse31) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse26) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse29 (+ (select .cse30 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse25 (store .cse30 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse29))) (let ((.cse27 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_4) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse25) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse28 (mod .cse29 4294967296))) (let ((.cse21 (store .cse27 (+ (* .cse28 4) (- 17179869184) func_to_recursive_line_32_to_33_0_~array.offset) (mod .cse29 2)))) (and (<= .cse20 2147483647) (= .cse21 .cse10) (= .cse22 .cse23) (= .cse0 (let ((.cse24 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse25) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse21) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse24 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse24 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (= .cse26 .cse27) (<= 2147483648 .cse28)))))))))))))) .cse19) (and (= |c_func_to_recursive_line_32_to_33_0_#in~array.base| |c_func_to_recursive_line_32_to_33_0_#in~index.base|) (let ((.cse42 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse0)))) (or (and (or (and (exists ((v_prenex_78 Int) (v_prenex_42 Int) (v_prenex_81 Int)) (let ((.cse38 (select (let ((.cse41 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse16 (+ .cse17 v_prenex_78) .cse18)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse40 (+ (select .cse41 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse39 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse41 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse40)))) (store .cse39 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse39 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (* (mod .cse40 4294967296) 4) v_prenex_42) (mod .cse40 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse37 (+ (select .cse38 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse36 (mod .cse37 4294967296))) (and (= .cse0 (let ((.cse34 (select (let ((.cse35 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse38 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse37)))) (store .cse35 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse35 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (* .cse36 4) v_prenex_81) (mod .cse37 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse34 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse34 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (<= .cse36 2147483647)))))) .cse42) (and (or (exists ((v_prenex_78 Int)) (let ((.cse51 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse16 (+ .cse17 v_prenex_78) .cse18)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse50 (+ (select .cse51 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse43 (mod .cse50 4294967296))) (and (<= .cse43 2147483647) (exists ((v_prenex_79 Int) (v_prenex_50 Int)) (let ((.cse48 (select (let ((.cse49 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse51 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse50)))) (store .cse49 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse49 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (* .cse43 4) v_prenex_50) (mod .cse50 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse47 (+ (select .cse48 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse44 (mod .cse47 4294967296))) (and (<= 2147483648 .cse44) (= .cse0 (let ((.cse45 (select (let ((.cse46 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse48 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse47)))) (store .cse46 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse46 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* 4 .cse44) v_prenex_79) (mod .cse47 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse45 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse45 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))))))))))))) (exists ((v_prenex_78 Int)) (let ((.cse59 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse16 (+ .cse17 v_prenex_78) .cse18)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse58 (+ (select .cse59 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse52 (mod .cse58 4294967296))) (and (<= 2147483648 .cse52) (exists ((v_prenex_51 Int) (v_prenex_80 Int)) (= .cse0 (let ((.cse53 (select (let ((.cse56 (select (let ((.cse57 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse59 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse58)))) (store .cse57 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse57 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* .cse52 4) v_prenex_51) (mod .cse58 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse55 (+ (select .cse56 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse54 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse56 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse55)))) (store .cse54 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse54 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) v_prenex_80 (* (mod .cse55 4294967296) 4)) (mod .cse55 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse53 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse53 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))))))))))) .cse42)) .cse19) (and (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int)) (let ((.cse67 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store .cse16 (+ (- 17179869184) .cse17 func_to_recursive_line_32_to_33_0_~array.offset) .cse18)) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse66 (+ (select .cse67 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse65 (mod .cse66 4294967296))) (and (exists ((v_prenex_51 Int) (v_prenex_80 Int)) (= .cse0 (let ((.cse60 (select (let ((.cse63 (select (let ((.cse64 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse67 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse66)))) (store .cse64 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse64 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* .cse65 4) v_prenex_51) (mod .cse66 2)))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse62 (+ (select .cse63 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse61 (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| (store .cse63 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse62)))) (store .cse61 |c_func_to_recursive_line_32_to_33_0_#in~array.base| (store (select .cse61 |c_func_to_recursive_line_32_to_33_0_#in~array.base|) (+ (- 17179869184) (* (mod .cse62 4294967296) 4) v_prenex_80) (mod .cse62 2)))))) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse60 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse60 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))))) (<= 2147483648 .cse65)))))) .cse42 .cse68)))) (and .cse1 (or (and (exists ((v_prenex_106 Int) (func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_28 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse71 (store .cse16 (+ (- 17179869184) .cse17 v_prenex_106) .cse18))) (let ((.cse80 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse71) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse79 (+ (select .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse78 (store .cse80 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse79))) (let ((.cse72 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_23) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse78) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse70 (store .cse72 (+ (- 17179869184) v_prenex_28 (* (mod .cse79 4294967296) 4)) (mod .cse79 2)))) (let ((.cse77 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse78) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse70) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse76 (+ (select .cse77 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse75 (store .cse77 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse76))) (let ((.cse69 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_4) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse75) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse73 (store .cse69 (+ (- 17179869184) (* (mod .cse76 4294967296) 4) func_to_recursive_line_32_to_33_0_~array.offset) (mod .cse76 2)))) (and (= .cse69 .cse70) (= .cse71 .cse72) (= .cse73 .cse10) (= .cse0 (let ((.cse74 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse75) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse73) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse74 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse74 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))))))))))))))))) .cse68) (and (exists ((func_to_recursive_line_32_to_33_0_~array.offset Int) (v_prenex_28 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_107 Int)) (let ((.cse82 (store .cse16 (+ .cse17 v_prenex_107) .cse18))) (let ((.cse93 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse82) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse92 (+ (select .cse93 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse91 (store .cse93 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse92))) (let ((.cse81 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_23) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse91) |c_func_to_recursive_line_32_to_33_0_#in~array.base|)) (.cse86 (mod .cse92 4294967296))) (let ((.cse88 (store .cse81 (+ (- 17179869184) v_prenex_28 (* .cse86 4)) (mod .cse92 2)))) (let ((.cse90 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse91) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse88) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (let ((.cse89 (+ (select .cse90 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1))) (let ((.cse85 (store .cse90 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| .cse89))) (let ((.cse87 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~array.base| v_DerPreprocessor_4) |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse85) |c_func_to_recursive_line_32_to_33_0_#in~array.base|))) (let ((.cse83 (store .cse87 (+ (- 17179869184) (* (mod .cse89 4294967296) 4) func_to_recursive_line_32_to_33_0_~array.offset) (mod .cse89 2)))) (and (= .cse81 .cse82) (= .cse10 .cse83) (= .cse0 (let ((.cse84 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_32_to_33_0_#in~index.base| .cse85) |c_func_to_recursive_line_32_to_33_0_#in~array.base| .cse83) |c_func_to_recursive_line_32_to_33_0_#in~index.base|))) (store .cse84 |c_func_to_recursive_line_32_to_33_0_#in~index.offset| (+ (select .cse84 |c_func_to_recursive_line_32_to_33_0_#in~index.offset|) 1)))) (<= 2147483648 .cse86) (= .cse87 .cse88)))))))))))))) .cse19))))))))) is different from false