./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.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_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/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_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/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_e18f033c-87eb-4147-9766-e81b7dc46e23/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 a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:49:40,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:49:40,461 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:49:40,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:49:40,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:49:40,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:49:40,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:49:40,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:49:40,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:49:40,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:49:40,508 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:49:40,508 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:49:40,509 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:49:40,510 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:49:40,511 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:49:40,511 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:49:40,512 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:49:40,513 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:49:40,514 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:49:40,515 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:49:40,515 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:49:40,517 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:49:40,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:49:40,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:49:40,519 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:49:40,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:49:40,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:49:40,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:49:40,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:49:40,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:49:40,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:49:40,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:49:40,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:49:40,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:49:40,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:49:40,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:49:40,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:49:40,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:49:40,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:49:40,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:49:40,530 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:49:40,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:49:40,532 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:49:40,532 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:49:40,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:49:40,533 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_e18f033c-87eb-4147-9766-e81b7dc46e23/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_e18f033c-87eb-4147-9766-e81b7dc46e23/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 -> a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba [2023-11-19 04:49:40,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:49:40,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:49:40,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:49:40,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:49:40,926 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:49:40,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2023-11-19 04:49:44,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:49:44,450 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:49:44,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2023-11-19 04:49:44,481 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/data/bc1350107/39124f69b2914ec08e0722bb4cb12d37/FLAG82f617c74 [2023-11-19 04:49:44,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/data/bc1350107/39124f69b2914ec08e0722bb4cb12d37 [2023-11-19 04:49:44,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:49:44,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:49:44,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:49:44,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:49:44,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:49:44,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:49:44" (1/1) ... [2023-11-19 04:49:44,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277df50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:44, skipping insertion in model container [2023-11-19 04:49:44,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:49:44" (1/1) ... [2023-11-19 04:49:44,586 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:49:44,895 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2023-11-19 04:49:44,901 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2023-11-19 04:49:44,908 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2023-11-19 04:49:44,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:49:44,929 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:49:44,990 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2023-11-19 04:49:44,992 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2023-11-19 04:49:44,997 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_e18f033c-87eb-4147-9766-e81b7dc46e23/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2023-11-19 04:49:44,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:49:45,035 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:49:45,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45 WrapperNode [2023-11-19 04:49:45,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:49:45,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:49:45,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:49:45,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:49:45,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,084 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-11-19 04:49:45,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:49:45,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:49:45,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:49:45,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:49:45,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:49:45,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:49:45,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:49:45,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:49:45,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (1/1) ... [2023-11-19 04:49:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:49:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:49:45,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:49:45,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:49:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:49:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:49:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:49:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:49:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:49:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:49:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:49:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:49:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:49:45,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:49:45,335 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:49:45,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:49:45,655 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:49:45,786 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:49:45,786 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-19 04:49:45,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:49:45 BoogieIcfgContainer [2023-11-19 04:49:45,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:49:45,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:49:45,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:49:45,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:49:45,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:49:44" (1/3) ... [2023-11-19 04:49:45,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e267bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:49:45, skipping insertion in model container [2023-11-19 04:49:45,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:49:45" (2/3) ... [2023-11-19 04:49:45,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e267bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:49:45, skipping insertion in model container [2023-11-19 04:49:45,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:49:45" (3/3) ... [2023-11-19 04:49:45,810 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2023-11-19 04:49:45,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:49:45,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-19 04:49:45,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:49:45,907 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;@47e6b106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:49:45,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 04:49:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:49:45,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:49:45,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:49:45,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:49:45,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:49:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1014884411, now seen corresponding path program 1 times [2023-11-19 04:49:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:49:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577677573] [2023-11-19 04:49:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:49:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:49:46,176 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 04:49:46,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:49:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577677573] [2023-11-19 04:49:46,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577677573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:49:46,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:49:46,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:49:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624001964] [2023-11-19 04:49:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:49:46,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:49:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:49:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:49:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:49:46,241 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:49:46,311 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2023-11-19 04:49:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:49:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 04:49:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:49:46,323 INFO L225 Difference]: With dead ends: 47 [2023-11-19 04:49:46,323 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 04:49:46,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:49:46,332 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:49:46,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:49:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 04:49:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-19 04:49:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-19 04:49:46,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2023-11-19 04:49:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:49:46,372 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-19 04:49:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-19 04:49:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:49:46,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:49:46,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:49:46,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:49:46,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:49:46,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:49:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1773939347, now seen corresponding path program 1 times [2023-11-19 04:49:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:49:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268174329] [2023-11-19 04:49:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:46,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:49:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:49:46,876 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 04:49:46,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:49:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268174329] [2023-11-19 04:49:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268174329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:49:46,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:49:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:49:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050580251] [2023-11-19 04:49:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:49:46,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:49:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:49:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:49:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:49:46,887 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:49:47,412 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2023-11-19 04:49:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:49:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:49:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:49:47,414 INFO L225 Difference]: With dead ends: 52 [2023-11-19 04:49:47,414 INFO L226 Difference]: Without dead ends: 33 [2023-11-19 04:49:47,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:49:47,416 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 04:49:47,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 04:49:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-19 04:49:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-11-19 04:49:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-19 04:49:47,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2023-11-19 04:49:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:49:47,425 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 04:49:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-19 04:49:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:49:47,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:49:47,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:49:47,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:49:47,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:49:47,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:49:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1773940597, now seen corresponding path program 1 times [2023-11-19 04:49:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:49:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323271690] [2023-11-19 04:49:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:49:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:49:47,487 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 04:49:47,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:49:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323271690] [2023-11-19 04:49:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323271690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:49:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:49:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:49:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89800270] [2023-11-19 04:49:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:49:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:49:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:49:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:49:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:49:47,491 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:49:47,608 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-19 04:49:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:49:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:49:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:49:47,610 INFO L225 Difference]: With dead ends: 47 [2023-11-19 04:49:47,610 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 04:49:47,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:49:47,612 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:49:47,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:49:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 04:49:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-11-19 04:49:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-19 04:49:47,623 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 8 [2023-11-19 04:49:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:49:47,623 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-19 04:49:47,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-19 04:49:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:49:47,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:49:47,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:49:47,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:49:47,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:49:47,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:49:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1936633858, now seen corresponding path program 1 times [2023-11-19 04:49:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:49:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672766637] [2023-11-19 04:49:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:49:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:49:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:49:48,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:49:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672766637] [2023-11-19 04:49:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672766637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:49:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956456863] [2023-11-19 04:49:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:48,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:49:48,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:49:48,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:49:48,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:49:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:49:48,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-19 04:49:48,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:49:48,638 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 6 treesize of output 5 [2023-11-19 04:49:48,647 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 18 treesize of output 7 [2023-11-19 04:49:48,661 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 18 treesize of output 7 [2023-11-19 04:49:49,220 INFO L349 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-11-19 04:49:49,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 207 [2023-11-19 04:49:49,308 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-11-19 04:49:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 234 [2023-11-19 04:49:49,378 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-19 04:49:49,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 188 [2023-11-19 04:49:49,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:49:49,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:49:49,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:49:49,546 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 04:49:49,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 04:49:49,598 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-19 04:49:49,708 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 83 treesize of output 69 [2023-11-19 04:49:49,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-19 04:49:49,726 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 7 treesize of output 5 [2023-11-19 04:49:49,731 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 12 [2023-11-19 04:49:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:49:49,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:49:49,937 INFO L349 Elim1Store]: treesize reduction 12, result has 70.0 percent of original size [2023-11-19 04:49:49,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 213 [2023-11-19 04:49:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:49:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956456863] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:49:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1059186246] [2023-11-19 04:49:50,756 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:49:50,757 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:49:50,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:49:50,768 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:49:50,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:49:56,212 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:49:57,207 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '440#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~prev~0#1.offset|) (= |ULTIMATE.start_main_~prev~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-11-19 04:49:57,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:49:57,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:49:57,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-19 04:49:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922501041] [2023-11-19 04:49:57,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:49:57,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 04:49:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:49:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 04:49:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=232, Unknown=2, NotChecked=0, Total=306 [2023-11-19 04:49:57,212 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:49:59,687 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-11-19 04:49:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:49:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 04:49:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:49:59,691 INFO L225 Difference]: With dead ends: 69 [2023-11-19 04:49:59,691 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 04:49:59,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=343, Unknown=7, NotChecked=0, Total=462 [2023-11-19 04:49:59,693 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:49:59,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 128 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 12 Unknown, 0 Unchecked, 2.0s Time] [2023-11-19 04:49:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 04:49:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2023-11-19 04:49:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-11-19 04:49:59,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 14 [2023-11-19 04:49:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:49:59,710 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-11-19 04:49:59,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:49:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-11-19 04:49:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:49:59,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:49:59,711 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:49:59,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:49:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:49:59,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:49:59,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:49:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash 22111694, now seen corresponding path program 2 times [2023-11-19 04:49:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:49:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035673124] [2023-11-19 04:49:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:49:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:50:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:50:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:50:01,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:50:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035673124] [2023-11-19 04:50:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035673124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:50:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759398072] [2023-11-19 04:50:01,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:50:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:50:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:50:01,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:50:01,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:50:01,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 04:50:01,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:50:01,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-19 04:50:01,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:50:01,335 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 18 treesize of output 7 [2023-11-19 04:50:01,341 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 18 treesize of output 7 [2023-11-19 04:50:01,347 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 6 treesize of output 5 [2023-11-19 04:50:01,631 INFO L349 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-11-19 04:50:01,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 219 [2023-11-19 04:50:01,702 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-11-19 04:50:01,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 246 [2023-11-19 04:50:01,765 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-19 04:50:01,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 198 [2023-11-19 04:50:01,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:50:01,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:50:01,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 04:50:01,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:50:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:01,912 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 04:50:01,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 04:50:01,931 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 04:50:01,940 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 21 treesize of output 1 [2023-11-19 04:50:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:01,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-19 04:50:01,988 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-19 04:50:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 04:50:02,119 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 83 treesize of output 69 [2023-11-19 04:50:02,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-19 04:50:02,139 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 7 treesize of output 5 [2023-11-19 04:50:02,145 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 12 [2023-11-19 04:50:02,183 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 04:50:02,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 04:50:02,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 04:50:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:50:02,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:50:02,344 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ |c_ULTIMATE.start_main_~prev~0#1.offset| 4)) 1)) is different from false [2023-11-19 04:50:02,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_282) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_286) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (not (= v_ArrVal_282 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_282 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-11-19 04:50:02,514 INFO L349 Elim1Store]: treesize reduction 12, result has 76.9 percent of original size [2023-11-19 04:50:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 225 [2023-11-19 04:50:02,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:50:02,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2023-11-19 04:50:02,763 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 12 treesize of output 8 [2023-11-19 04:50:02,915 INFO L349 Elim1Store]: treesize reduction 35, result has 53.3 percent of original size [2023-11-19 04:50:02,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 158 [2023-11-19 04:50:03,077 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-19 04:50:03,078 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 3 case distinctions, treesize of input 36 treesize of output 13 [2023-11-19 04:50:03,094 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 8 treesize of output 4 [2023-11-19 04:50:03,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:50:03,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 519 treesize of output 519 [2023-11-19 04:50:03,441 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 257 treesize of output 253 [2023-11-19 04:50:03,479 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 253 treesize of output 249 [2023-11-19 04:50:03,497 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 249 treesize of output 245 [2023-11-19 04:50:03,543 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 8 treesize of output 4 [2023-11-19 04:50:03,677 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 7 treesize of output 3 [2023-11-19 04:50:03,708 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 7 treesize of output 3 [2023-11-19 04:50:03,713 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 8 treesize of output 4 [2023-11-19 04:50:03,727 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 7 treesize of output 3 [2023-11-19 04:50:03,742 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 7 treesize of output 3 [2023-11-19 04:50:03,757 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 7 treesize of output 3 [2023-11-19 04:50:03,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:50:03,777 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 54 treesize of output 54 [2023-11-19 04:50:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-19 04:50:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759398072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:50:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59209676] [2023-11-19 04:50:04,366 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:50:04,366 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:50:04,367 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:50:04,367 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:50:04,367 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:50:09,500 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:50:10,451 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '711#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~prev~0#1.offset|) (= |ULTIMATE.start_main_~prev~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-11-19 04:50:10,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:50:10,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:50:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-19 04:50:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325610938] [2023-11-19 04:50:10,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:50:10,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 04:50:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:50:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 04:50:10,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=395, Unknown=4, NotChecked=82, Total=552 [2023-11-19 04:50:10,456 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:10,924 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select .cse2 0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select .cse1 4) 1) (not (= .cse0 0)) (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_282) (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_286) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (not (= v_ArrVal_282 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_282 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_21) 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (store .cse3 0 .cse0) .cse2) (= (select .cse3 0) 0)))) (= 0 |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from true [2023-11-19 04:50:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:50:11,284 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-11-19 04:50:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:50:11,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:50:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:50:11,286 INFO L225 Difference]: With dead ends: 60 [2023-11-19 04:50:11,286 INFO L226 Difference]: Without dead ends: 58 [2023-11-19 04:50:11,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=513, Unknown=5, NotChecked=144, Total=756 [2023-11-19 04:50:11,289 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 04:50:11,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 214 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 1 Unknown, 87 Unchecked, 0.7s Time] [2023-11-19 04:50:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-19 04:50:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-11-19 04:50:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-19 04:50:11,321 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 15 [2023-11-19 04:50:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:50:11,321 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-19 04:50:11,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-11-19 04:50:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:50:11,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:50:11,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:50:11,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:50:11,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:50:11,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:50:11,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:50:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash -560672479, now seen corresponding path program 1 times [2023-11-19 04:50:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:50:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434668041] [2023-11-19 04:50:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:50:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:50:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:50:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:50:11,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:50:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434668041] [2023-11-19 04:50:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434668041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:50:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524258025] [2023-11-19 04:50:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:50:11,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:50:11,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:50:11,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:50:11,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:50:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:50:11,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-19 04:50:11,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:50:11,871 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 25 treesize of output 17 [2023-11-19 04:50:11,874 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 21 treesize of output 13 [2023-11-19 04:50:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:50:11,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:50:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:50:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524258025] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:50:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [837256122] [2023-11-19 04:50:11,927 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-19 04:50:11,930 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:50:11,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:50:11,930 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:50:11,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:50:16,405 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:50:17,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '973#(and (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_36| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet6#1_36| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_36| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_36| 2147483647))))' at error location [2023-11-19 04:50:17,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:50:17,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:50:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-19 04:50:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629153903] [2023-11-19 04:50:17,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:50:17,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:50:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:50:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:50:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:50:17,040 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:50:17,334 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-19 04:50:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:50:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:50:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:50:17,336 INFO L225 Difference]: With dead ends: 50 [2023-11-19 04:50:17,336 INFO L226 Difference]: Without dead ends: 46 [2023-11-19 04:50:17,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-19 04:50:17,337 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:50:17,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:50:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-19 04:50:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-19 04:50:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-11-19 04:50:17,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2023-11-19 04:50:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:50:17,358 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-11-19 04:50:17,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-11-19 04:50:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:50:17,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:50:17,360 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:50:17,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:50:17,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:50:17,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:50:17,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:50:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 613681662, now seen corresponding path program 3 times [2023-11-19 04:50:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:50:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182669951] [2023-11-19 04:50:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:50:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:50:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:50:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:50:18,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:50:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182669951] [2023-11-19 04:50:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182669951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:50:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910201672] [2023-11-19 04:50:18,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 04:50:18,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:50:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:50:18,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:50:18,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e18f033c-87eb-4147-9766-e81b7dc46e23/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:50:18,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 04:50:18,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:50:18,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-19 04:50:18,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:50:18,934 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 18 treesize of output 7 [2023-11-19 04:50:18,943 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 18 treesize of output 7 [2023-11-19 04:50:18,949 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 6 treesize of output 5 [2023-11-19 04:50:19,277 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-19 04:50:19,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 213 [2023-11-19 04:50:19,419 INFO L349 Elim1Store]: treesize reduction 104, result has 24.1 percent of original size [2023-11-19 04:50:19,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 198 treesize of output 272 [2023-11-19 04:50:19,501 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-19 04:50:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 202 [2023-11-19 04:50:19,602 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-19 04:50:19,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 219 [2023-11-19 04:50:19,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:50:19,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:19,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:50:19,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:50:19,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:19,719 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-19 04:50:19,719 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 57 [2023-11-19 04:50:19,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:50:19,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 04:50:19,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:19,768 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:50:19,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 7 [2023-11-19 04:50:19,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:50:19,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 04:50:19,830 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-19 04:50:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 72 [2023-11-19 04:50:19,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-19 04:50:19,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2023-11-19 04:50:19,956 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 04:50:19,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 40 [2023-11-19 04:50:19,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-19 04:50:19,971 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 30 treesize of output 22 [2023-11-19 04:50:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:50:20,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:50:20,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_493) .cse0) .cse1) 0)) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_492) .cse0) .cse1) 0)))) is different from false [2023-11-19 04:50:20,300 INFO L349 Elim1Store]: treesize reduction 12, result has 70.0 percent of original size [2023-11-19 04:50:20,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 273 [2023-11-19 04:50:21,709 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 5 treesize of output 3 [2023-11-19 04:50:22,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse12 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (= (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (.cse14 (= .cse12 0)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse1)) (not (= .cse2 (store .cse3 .cse4 (select .cse2 .cse4)))) (not (= .cse2 v_DerPreprocessor_42)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse1 v_DerPreprocessor_44))) (select (select (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse8)) (not (= .cse9 (store .cse3 .cse4 (select .cse9 .cse4)))) (not (= .cse9 v_DerPreprocessor_42)) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store .cse10 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse8 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))))) (or (and (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int)) (= 0 (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse12 v_DerPreprocessor_61))) (select (select (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_62))) (select (store .cse13 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse12 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (not (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|)) (and .cse0 .cse14)) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse15)) (not (= .cse16 (store .cse3 .cse4 (select .cse16 .cse4)))) (not (= .cse16 v_DerPreprocessor_42)) (= .cse15 0) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse15 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))) (or (not .cse0) (not .cse14) (let ((.cse18 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse24 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (and (or .cse18 (let ((.cse20 (store .cse3 0 0)) (.cse21 (store .cse7 0 0))) (and (forall ((v_DerPreprocessor_59 Int) (v_DerPreprocessor_60 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse20 4 v_DerPreprocessor_59)))) (select (store .cse19 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse21 4 v_DerPreprocessor_60)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_DerPreprocessor_59 Int) (v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_60 Int)) (= (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse21 4 v_DerPreprocessor_60)))) (select (select (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse20 4 v_DerPreprocessor_59)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) (not .cse23) .cse24) (or (and (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_52)))) (store .cse30 v_DerPreprocessor_52 (store (store (select .cse30 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse25 v_DerPreprocessor_52)) (not (= v_DerPreprocessor_53 (select .cse26 .cse4))) (not (= (select |c_#valid| .cse25) 0)) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse27 (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 .cse4 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse29 .cse25 (store (store (select .cse29 .cse25) 0 0) 4 v_DerPreprocessor_51))))) (or (not (= (select (select .cse27 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4) v_DerPreprocessor_50)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store .cse28 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (= .cse25 0)))))) (or (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 4)) .cse18 .cse24 (and (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_492 (Array Int Int))) (= (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse7 8 v_DerPreprocessor_57) 0 0) 4 v_DerPreprocessor_58)))) (select (select (store .cse31 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse3 8 v_DerPreprocessor_55) 0 0) 4 v_DerPreprocessor_56)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse3 8 v_DerPreprocessor_55) 0 0) 4 v_DerPreprocessor_56)))) (select (store .cse32 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse7 8 v_DerPreprocessor_57) 0 0) 4 v_DerPreprocessor_58)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse36 (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_52)))) (store .cse38 v_DerPreprocessor_52 (store (store (select .cse38 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse33 v_DerPreprocessor_52)) (not (= v_DerPreprocessor_53 (select .cse34 .cse4))) (not (= (select |c_#valid| .cse33) 0)) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse35 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 .cse4 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse37 .cse33 (store (store (select .cse37 .cse33) 0 0) 4 v_DerPreprocessor_51))))) (or (not (= (select (select .cse35 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4) v_DerPreprocessor_50)) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (= .cse33 0))))))) .cse23) (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int)) (let ((.cse39 (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_47)))) (store .cse42 v_DerPreprocessor_47 (store (store (select .cse42 v_DerPreprocessor_47) 0 0) 4 v_DerPreprocessor_49))))) (let ((.cse41 (select (select .cse39 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_45 Int) (v_ArrVal_493 (Array Int Int))) (= 0 (select (select (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 .cse4 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse40 .cse41 (store (store (select .cse40 .cse41) 0 0) 4 v_DerPreprocessor_46))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= 0 (select |c_#valid| .cse41))) (not (= v_DerPreprocessor_47 .cse41)) (= .cse41 0) (= .cse41 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int)) (let ((.cse45 (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_47)))) (store .cse47 v_DerPreprocessor_47 (store (store (select .cse47 v_DerPreprocessor_47) 0 0) 4 v_DerPreprocessor_49))))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= 0 (select |c_#valid| .cse43))) (not (= v_DerPreprocessor_47 .cse43)) (= .cse43 0) (= .cse43 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_45 Int) (v_ArrVal_492 (Array Int Int))) (= 0 (let ((.cse44 (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 .cse4 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse46 .cse43 (store (store (select .cse46 .cse43) 0 0) 4 v_DerPreprocessor_46))))) (select (select (store .cse44 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse48)) (not (= .cse49 (store .cse3 .cse4 (select .cse49 .cse4)))) (not (= .cse49 v_DerPreprocessor_42)) (= .cse48 0) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse4 v_ArrVal_480)) .cse48 v_DerPreprocessor_44))) (select (select (store .cse50 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse50 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))))))) is different from false [2023-11-19 04:50:25,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse0 (= (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (.cse11 (= .cse10 0)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_DerPreprocessor_42 .cse1)) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse2 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_41 .cse2)) (not (= .cse1 (store .cse5 .cse4 (select .cse1 .cse4)))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_DerPreprocessor_42 .cse6)) (not (= v_DerPreprocessor_41 .cse7)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse7 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse7) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse7 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= .cse6 (store .cse5 .cse4 (select .cse6 .cse4)))))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse8 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_DerPreprocessor_42 .cse8)) (not (= v_DerPreprocessor_41 .cse9)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse9 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse9) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse9 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= .cse8 (store .cse5 .cse4 (select .cse8 .cse4)))) (= .cse9 0))))) (or (not (= .cse10 |c_ULTIMATE.start_main_~head~0#1.base|)) (and .cse0 .cse11) (and (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_62))) (select (store .cse12 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse10 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse10 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (or (not .cse0) (let ((.cse14 (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (.cse13 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse15 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 0)))) (and (or .cse13 (and (or .cse14 (and (forall ((v_DerPreprocessor_58 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_493 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) v_DerPreprocessor_56) v_DerPreprocessor_58))) (forall ((v_DerPreprocessor_58 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_492 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) v_DerPreprocessor_56) v_DerPreprocessor_58)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| 4)) .cse15) (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse20 (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse5 .cse4 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_52)))) (store .cse21 v_DerPreprocessor_52 (store (store (select .cse21 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse16 (select .cse20 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse16 0) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (let ((.cse17 (store (store (select .cse19 .cse16) 0 0) 4 v_DerPreprocessor_51))) (let ((.cse18 (select (store .cse19 .cse16 .cse17) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse16 .cse17) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) .cse16) (select .cse18 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_50 (select .cse18 .cse4)))))))) (not (= 0 (select |c_#valid| .cse16))) (not (= v_DerPreprocessor_52 .cse16)) (not (= v_DerPreprocessor_53 (select .cse20 .cse4))))))) (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse5 .cse4 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_52)))) (let ((.cse23 (store (store (select .cse27 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))) (let ((.cse26 (select (store .cse27 v_DerPreprocessor_52 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse22 (select .cse26 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse22 0) (not (= 0 (select |c_#valid| .cse22))) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse24 (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (store .cse25 .cse22 (store (store (select .cse25 .cse22) 0 0) 4 v_DerPreprocessor_51))) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_52 .cse23) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse22) (select .cse24 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_50 (select .cse24 .cse4)))))) (not (= v_DerPreprocessor_52 .cse22)) (not (= v_DerPreprocessor_53 (select .cse26 .cse4))))))))))) (or .cse14 (not .cse13) .cse15 (and (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) 0) 0) 0)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) 0) 0) 0)))))) (not .cse11)) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse28 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_DerPreprocessor_42 .cse28)) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) .cse29) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_480)) .cse29 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_41 .cse29)) (not (= .cse28 (store .cse5 .cse4 (select .cse28 .cse4)))) (= .cse29 0))))))))) is different from false [2023-11-19 04:50:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 04:50:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910201672] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:50:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [853922105] [2023-11-19 04:50:26,353 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:50:26,353 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:50:26,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:50:26,353 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:50:26,354 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:50:31,259 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:50:32,101 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1224#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~prev~0#1.offset|) (= |ULTIMATE.start_main_~prev~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2023-11-19 04:50:32,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:50:32,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:50:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-19 04:50:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785528149] [2023-11-19 04:50:32,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:50:32,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 04:50:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:50:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 04:50:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=212, Unknown=3, NotChecked=96, Total=380 [2023-11-19 04:50:32,104 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:50:34,325 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse12 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (.cse14 (= .cse12 0)) (.cse18 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse24 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (or .cse1 (and (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse2)) (not (= .cse3 (store .cse4 .cse5 (select .cse3 .cse5)))) (not (= .cse3 v_DerPreprocessor_42)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse2 v_DerPreprocessor_44))) (select (select (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse8)) (not (= .cse9 (store .cse4 .cse5 (select .cse9 .cse5)))) (not (= .cse9 v_DerPreprocessor_42)) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store .cse10 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse8 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))))) (or (and (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int)) (= 0 (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse12 v_DerPreprocessor_61))) (select (select (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_62))) (select (store .cse13 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse12 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (not (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|)) (and .cse1 .cse14)) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse15)) (not (= .cse16 (store .cse4 .cse5 (select .cse16 .cse5)))) (not (= .cse16 v_DerPreprocessor_42)) (= .cse15 0) (forall ((v_ArrVal_480 Int) (v_ArrVal_493 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (= (select (select (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse15 v_DerPreprocessor_44) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))) (not .cse18) (or (not .cse1) (not .cse14) (let ((.cse19 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)))) (and (or .cse19 (let ((.cse21 (store .cse4 0 0)) (.cse22 (store .cse0 0 0))) (and (forall ((v_DerPreprocessor_59 Int) (v_DerPreprocessor_60 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse21 4 v_DerPreprocessor_59)))) (select (store .cse20 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse22 4 v_DerPreprocessor_60)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (forall ((v_DerPreprocessor_59 Int) (v_ArrVal_492 (Array Int Int)) (v_DerPreprocessor_60 Int)) (= (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse22 4 v_DerPreprocessor_60)))) (select (select (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse21 4 v_DerPreprocessor_59)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) (not .cse24) .cse18) (or (and (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse4 .cse5 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_52)))) (store .cse30 v_DerPreprocessor_52 (store (store (select .cse30 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse25 v_DerPreprocessor_52)) (not (= v_DerPreprocessor_53 (select .cse26 .cse5))) (not (= (select |c_#valid| .cse25) 0)) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse27 (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse0 .cse5 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse29 .cse25 (store (store (select .cse29 .cse25) 0 0) 4 v_DerPreprocessor_51))))) (or (not (= (select (select .cse27 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) v_DerPreprocessor_50)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store .cse28 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (= .cse25 0)))))) (or (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 4)) .cse19 .cse18 (and (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_492 (Array Int Int))) (= (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse0 8 v_DerPreprocessor_57) 0 0) 4 v_DerPreprocessor_58)))) (select (select (store .cse31 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse4 8 v_DerPreprocessor_55) 0 0) 4 v_DerPreprocessor_56)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (forall ((v_DerPreprocessor_57 Int) (v_DerPreprocessor_58 Int) (v_DerPreprocessor_55 Int) (v_DerPreprocessor_56 Int) (v_ArrVal_493 (Array Int Int))) (= (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse4 8 v_DerPreprocessor_55) 0 0) 4 v_DerPreprocessor_56)))) (select (store .cse32 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse0 8 v_DerPreprocessor_57) 0 0) 4 v_DerPreprocessor_58)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (forall ((v_DerPreprocessor_53 Int) (v_DerPreprocessor_54 Int) (v_DerPreprocessor_52 Int)) (let ((.cse36 (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse4 .cse5 v_DerPreprocessor_53) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_52)))) (store .cse38 v_DerPreprocessor_52 (store (store (select .cse38 v_DerPreprocessor_52) 0 0) 4 v_DerPreprocessor_54))))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse33 v_DerPreprocessor_52)) (not (= v_DerPreprocessor_53 (select .cse34 .cse5))) (not (= (select |c_#valid| .cse33) 0)) (forall ((v_DerPreprocessor_50 Int) (v_DerPreprocessor_51 Int)) (let ((.cse35 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse0 .cse5 v_DerPreprocessor_50) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse37 .cse33 (store (store (select .cse37 .cse33) 0 0) 4 v_DerPreprocessor_51))))) (or (not (= (select (select .cse35 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) v_DerPreprocessor_50)) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (= .cse33 0))))))) .cse24) (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int)) (let ((.cse39 (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse4 .cse5 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_47)))) (store .cse42 v_DerPreprocessor_47 (store (store (select .cse42 v_DerPreprocessor_47) 0 0) 4 v_DerPreprocessor_49))))) (let ((.cse41 (select (select .cse39 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_45 Int) (v_ArrVal_493 (Array Int Int))) (= 0 (select (select (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_493) (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse0 .cse5 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse40 .cse41 (store (store (select .cse40 .cse41) 0 0) 4 v_DerPreprocessor_46))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= 0 (select |c_#valid| .cse41))) (not (= v_DerPreprocessor_47 .cse41)) (= .cse41 0) (= .cse41 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_DerPreprocessor_47 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int)) (let ((.cse45 (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse4 .cse5 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_47)))) (store .cse47 v_DerPreprocessor_47 (store (store (select .cse47 v_DerPreprocessor_47) 0 0) 4 v_DerPreprocessor_49))))) (let ((.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= 0 (select |c_#valid| .cse43))) (not (= v_DerPreprocessor_47 .cse43)) (= .cse43 0) (= .cse43 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_DerPreprocessor_46 Int) (v_DerPreprocessor_45 Int) (v_ArrVal_492 (Array Int Int))) (= 0 (let ((.cse44 (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse0 .cse5 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse46 .cse43 (store (store (select .cse46 .cse43) 0 0) 4 v_DerPreprocessor_46))))) (select (select (store .cse44 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))) (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_41 Int)) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse48 (select .cse49 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_41 .cse48)) (not (= .cse49 (store .cse4 .cse5 (select .cse49 .cse5)))) (not (= .cse49 v_DerPreprocessor_42)) (= .cse48 0) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_480 Int) (v_DerPreprocessor_44 (Array Int Int))) (= (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse5 v_ArrVal_480)) .cse48 v_DerPreprocessor_44))) (select (select (store .cse50 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse50 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))))))) .cse24 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse4 0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0))))) is different from true