./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje --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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:26,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:26,737 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:29:26,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:26,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:26,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:26,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:26,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:26,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:26,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:26,790 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:26,791 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:26,791 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:26,792 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:29:26,792 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:26,792 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:26,793 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:29:26,793 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:29:26,793 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:26,794 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:29:26,794 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:29:26,795 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:29:26,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:26,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:26,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:29:26,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:26,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:29:26,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:26,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:26,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:26,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:26,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:26,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:29:26,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:26,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:26,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:26,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:26,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:26,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:26,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:26,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:26,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:26,802 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:29:26,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:26,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:26,803 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:26,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:26,804 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_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/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_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-09 04:29:27,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:27,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:27,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:27,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:27,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:27,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i Unable to find full path for "g++" [2024-11-09 04:29:29,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:29,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:29,512 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-09 04:29:29,525 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/data/94f296824/ec9b5c58d4ae4670bd8dd473f344c791/FLAG56e972303 [2024-11-09 04:29:29,850 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/data/94f296824/ec9b5c58d4ae4670bd8dd473f344c791 [2024-11-09 04:29:29,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:29,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:29,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:29,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:29,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:29,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac22094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29, skipping insertion in model container [2024-11-09 04:29:29,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:30,303 WARN L250 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_73ad427a-7bcb-4c07-8d6c-488b51158f71/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-09 04:29:30,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:30,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:30,392 WARN L250 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_73ad427a-7bcb-4c07-8d6c-488b51158f71/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-09 04:29:30,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:30,425 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:30,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30 WrapperNode [2024-11-09 04:29:30,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:30,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:30,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:30,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:30,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,471 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104 [2024-11-09 04:29:30,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:30,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:30,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:30,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:30,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:30,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:30,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:30,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:30,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (1/1) ... [2024-11-09 04:29:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:30,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:30,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:29:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 04:29:30,591 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 04:29:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:29:30,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:30,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:29:30,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:30,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:30,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:30,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:31,027 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:31,027 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:31,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:31,144 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:29:31,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:31 BoogieIcfgContainer [2024-11-09 04:29:31,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:31,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:31,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:31,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:31,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:29" (1/3) ... [2024-11-09 04:29:31,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2ca6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:31, skipping insertion in model container [2024-11-09 04:29:31,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:30" (2/3) ... [2024-11-09 04:29:31,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2ca6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:31, skipping insertion in model container [2024-11-09 04:29:31,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:31" (3/3) ... [2024-11-09 04:29:31,160 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-11-09 04:29:31,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:31,177 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:31,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:31,244 INFO L333 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, 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;@5409c59b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:31,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:29:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:29:31,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:31,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:31,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:31,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1122314268, now seen corresponding path program 1 times [2024-11-09 04:29:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932227792] [2024-11-09 04:29:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:31,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932227792] [2024-11-09 04:29:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932227792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:29:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766064912] [2024-11-09 04:29:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:31,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:29:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:29:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:31,773 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:29:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:31,853 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-11-09 04:29:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:29:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 04:29:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:31,864 INFO L225 Difference]: With dead ends: 30 [2024-11-09 04:29:31,864 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 04:29:31,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:29:31,869 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:31,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:29:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 04:29:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 04:29:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:29:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-09 04:29:31,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-11-09 04:29:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:31,904 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 04:29:31,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:29:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-09 04:29:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 04:29:31,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:31,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:29:31,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1096235821, now seen corresponding path program 1 times [2024-11-09 04:29:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576367757] [2024-11-09 04:29:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:29:32,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576367757] [2024-11-09 04:29:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576367757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:32,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:32,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:29:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983153095] [2024-11-09 04:29:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:29:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:29:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:29:32,115 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:32,183 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-09 04:29:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:29:32,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 04:29:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:32,185 INFO L225 Difference]: With dead ends: 24 [2024-11-09 04:29:32,185 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 04:29:32,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:29:32,186 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:32,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:29:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 04:29:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 04:29:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:29:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 04:29:32,192 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 19 [2024-11-09 04:29:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:32,192 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 04:29:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-09 04:29:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:29:32,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:32,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:32,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:29:32,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:32,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash 848844578, now seen corresponding path program 1 times [2024-11-09 04:29:32,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595221572] [2024-11-09 04:29:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:29:32,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595221572] [2024-11-09 04:29:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595221572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116848698] [2024-11-09 04:29:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:32,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:32,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:32,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:32,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:29:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:32,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:29:32,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:29:32,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:29:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:29:32,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116848698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:29:32,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799466545] [2024-11-09 04:29:32,938 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:29:32,939 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:29:32,942 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:29:32,948 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:29:32,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:29:35,920 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2024-11-09 04:29:36,155 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:29:41,845 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '283#(exists ((|v_ULTIMATE.start_main_~i~0#1_30| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_21| Int) (|v_ULTIMATE.start_main_~len~0#1_17| Int)) (and (<= 1 |#StackHeapBarrier|) (= 0 |v_ULTIMATE.start_main_~#s~0#1.offset_21|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_main_~len~0#1_17| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |v_ULTIMATE.start_main_~i~0#1_30|)))' at error location [2024-11-09 04:29:41,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:29:41,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:29:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-09 04:29:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162150962] [2024-11-09 04:29:41,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:29:41,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:29:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:29:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:29:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:29:41,849 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:41,988 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-09 04:29:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:29:41,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 04:29:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:41,991 INFO L225 Difference]: With dead ends: 26 [2024-11-09 04:29:41,991 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 04:29:41,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:29:41,993 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:41,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:29:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 04:29:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 04:29:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:29:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-09 04:29:41,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 21 [2024-11-09 04:29:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-09 04:29:42,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:29:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-09 04:29:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 04:29:42,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:42,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:42,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:29:42,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:42,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -670938665, now seen corresponding path program 2 times [2024-11-09 04:29:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169597089] [2024-11-09 04:29:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:45,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:29:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169597089] [2024-11-09 04:29:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169597089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:29:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346534448] [2024-11-09 04:29:45,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:29:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:29:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:45,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:29:45,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73ad427a-7bcb-4c07-8d6c-488b51158f71/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:29:46,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 04:29:46,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:29:46,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-09 04:29:46,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:46,633 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 6 treesize of output 5 [2024-11-09 04:29:46,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 04:29:46,802 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 11 treesize of output 11 [2024-11-09 04:29:46,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:46,894 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 14 treesize of output 14 [2024-11-09 04:29:46,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 04:29:46,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 24 treesize of output 32 [2024-11-09 04:29:46,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 33 [2024-11-09 04:29:47,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:47,080 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 46 [2024-11-09 04:29:47,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2024-11-09 04:29:47,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 27 [2024-11-09 04:29:47,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-09 04:29:47,126 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 74 treesize of output 60 [2024-11-09 04:29:47,401 INFO L349 Elim1Store]: treesize reduction 146, result has 7.0 percent of original size [2024-11-09 04:29:47,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 311 treesize of output 200 [2024-11-09 04:29:47,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:47,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:47,430 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:29:47,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 112 [2024-11-09 04:29:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:47,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:29:47,456 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 04:29:47,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 31 [2024-11-09 04:29:47,465 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 21 treesize of output 26 [2024-11-09 04:29:47,479 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 170 treesize of output 139 [2024-11-09 04:29:47,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 04:29:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-09 04:29:47,989 INFO L349 Elim1Store]: treesize reduction 306, result has 6.7 percent of original size [2024-11-09 04:29:47,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 351 treesize of output 303 [2024-11-09 04:29:48,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 158 [2024-11-09 04:29:48,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:48,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 114 treesize of output 140 [2024-11-09 04:29:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:48,096 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-09 04:29:48,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 176 [2024-11-09 04:29:48,122 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 193 treesize of output 178 [2024-11-09 04:29:48,295 INFO L349 Elim1Store]: treesize reduction 144, result has 11.1 percent of original size [2024-11-09 04:29:48,296 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 212 treesize of output 166 [2024-11-09 04:29:48,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:48,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:29:48,347 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 04:29:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 29 [2024-11-09 04:29:48,353 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 14 treesize of output 11 [2024-11-09 04:29:48,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:29:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:29:48,414 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 63 treesize of output 48 [2024-11-09 04:29:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2024-11-09 04:29:49,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:29:49,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 193 treesize of output 201 [2024-11-09 04:29:49,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:29:49,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 109 treesize of output 173 [2024-11-09 04:29:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:29:51,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:29:52,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ .cse5 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse6)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse6))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) (+ 4 .cse4)))) (let ((.cse0 (= .cse2 .cse1))) (and (or .cse0 (and (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_17) .cse2 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_12) .cse2 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (or (and (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_DerPreprocessor_11 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (not .cse0))))) (and (= .cse5 .cse4) (= .cse3 .cse1)))))) is different from false [2024-11-09 04:29:52,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:29:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 709 treesize of output 766 [2024-11-09 04:29:52,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:29:52,390 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 2 case distinctions, treesize of input 685 treesize of output 714 [2024-11-09 04:29:56,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse100 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse101 (select |c_#memory_$Pointer$.base| .cse6)) (.cse97 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse98 (+ .cse100 4))) (let ((.cse104 (select .cse97 .cse98)) (.cse102 (select .cse101 .cse98))) (let ((.cse1 (= .cse102 .cse6)) (.cse0 (= .cse100 .cse104))) (and (or (and .cse0 .cse1) (let ((.cse103 (+ 4 .cse104))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| .cse102) .cse103)) (.cse99 (select (select |c_#memory_$Pointer$.offset| .cse102) .cse103))) (let ((.cse12 (store (select (store |c_#memory_$Pointer$.base| .cse6 (store .cse101 .cse98 .cse10)) .cse10) .cse99 .cse6))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse10 .cse12))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select .cse18 .cse16)) (.cse11 (store (select (store |c_#memory_$Pointer$.offset| .cse6 (store .cse97 .cse98 .cse99)) .cse10) .cse99 .cse100))) (and (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ .cse7 4))) (let ((.cse8 (select (select .cse5 .cse2) .cse9))) (let ((.cse3 (select (select .cse4 (select (select .cse4 .cse2) .cse9)) (+ .cse8 4)))) (or (not (= .cse2 .cse3)) (= (select (select (store .cse4 .cse3 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= v_DerPreprocessor_26 (select .cse5 .cse6))) (= .cse7 .cse8)))))))) (not (= v_DerPreprocessor_27 (select .cse4 .cse6)))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (+ .cse14 4))) (let ((.cse13 (select (select .cse15 .cse16) .cse20))) (let ((.cse17 (select (select .cse18 (select .cse19 .cse20)) (+ .cse13 4)))) (or (= .cse13 .cse14) (not (= v_DerPreprocessor_26 (select .cse15 .cse6))) (not (= .cse16 .cse17)) (forall ((v_DerPreprocessor_11 (Array Int Int))) (= (select (select (store .cse18 .cse17 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse24 (+ (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse21 (select .cse19 .cse24))) (let ((.cse22 (select (select .cse18 .cse21) (+ (select (select .cse23 .cse16) .cse24) 4)))) (or (= .cse16 .cse21) (not (= .cse16 .cse22)) (forall ((v_DerPreprocessor_11 (Array Int Int))) (= (select (select (store .cse18 .cse22 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (+ .cse26 4))) (let ((.cse25 (select (select .cse27 .cse16) .cse29))) (let ((.cse28 (select (select .cse18 (select .cse19 .cse29)) (+ .cse25 4)))) (or (= .cse25 .cse26) (not (= v_DerPreprocessor_26 (select .cse27 .cse6))) (= .cse16 .cse28) (forall ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (= (select (select (store (store .cse18 .cse16 v_DerPreprocessor_12) .cse28 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse33 (+ (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse32 (select .cse19 .cse33))) (let ((.cse31 (select (select .cse18 .cse32) (+ (select (select .cse30 .cse16) .cse33) 4)))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (select (select (store .cse30 .cse31 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= .cse16 .cse32) (not (= .cse16 .cse31)))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse37 (+ (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse34 (select .cse19 .cse37))) (let ((.cse35 (select (select .cse18 .cse34) (+ (select (select .cse36 .cse16) .cse37) 4)))) (or (= .cse16 .cse34) (= .cse16 .cse35) (forall ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (= (select (select (store (store .cse18 .cse16 v_DerPreprocessor_12) .cse35 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (not (= v_DerPreprocessor_27 (select .cse38 .cse6))) (forall ((v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_22) .cse10 .cse11))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (+ .cse42 4))) (let ((.cse43 (select (select .cse41 .cse39) .cse44))) (let ((.cse40 (select (select .cse38 (select (select .cse38 .cse39) .cse44)) (+ .cse43 4)))) (or (= .cse39 .cse40) (not (= v_prenex_22 (select .cse41 .cse6))) (= (select (select (store (store .cse38 .cse39 v_prenex_23) .cse40 v_prenex_24) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse42 .cse43))))))))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_16) .cse10 .cse11))) (let ((.cse45 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (+ (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse48 (select (select .cse49 .cse45) .cse50))) (let ((.cse46 (select (select .cse49 .cse48) (+ (select (select .cse47 .cse45) .cse50) 4)))) (or (not (= .cse45 .cse46)) (= (select (select (store .cse47 .cse46 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse45 .cse48))))))) (not (= v_DerPreprocessor_27 (select .cse49 .cse6)))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_prenex_25 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_25) .cse10 .cse11))) (let ((.cse54 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse52 (select (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (+ .cse54 4))) (let ((.cse55 (select (select .cse51 .cse52) .cse57))) (let ((.cse53 (select (select .cse56 (select (select .cse56 .cse52) .cse57)) (+ .cse55 4)))) (or (= (select (select (store (store .cse51 .cse52 v_prenex_26) .cse53 v_prenex_27) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse54 .cse55) (= .cse52 .cse53) (not (= v_prenex_25 (select .cse51 .cse6)))))))))) (not (= v_DerPreprocessor_27 (select .cse56 .cse6)))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_15) .cse10 .cse11))) (let ((.cse59 (select (select .cse62 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (+ (select (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse61 (select (select .cse62 .cse59) .cse63))) (let ((.cse60 (select (select .cse62 .cse61) (+ 4 (select (select .cse58 .cse59) .cse63))))) (or (= (select (select (store (store .cse58 .cse59 v_DerPreprocessor_17) .cse60 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse61 .cse59) (= .cse59 .cse60))))))) (not (= v_DerPreprocessor_27 (select .cse62 .cse6)))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (not (= v_DerPreprocessor_27 (select .cse64 .cse6))) (forall ((v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse68 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_17) .cse10 .cse11))) (let ((.cse66 (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ (select (select .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse67 (select (select .cse64 .cse66) .cse69))) (let ((.cse65 (select (select .cse64 .cse67) (+ (select (select .cse68 .cse66) .cse69) 4)))) (or (= (select (select (store .cse64 .cse65 v_prenex_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse66 .cse65)) (= .cse66 .cse67)))))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse71 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse74 (+ .cse71 4))) (let ((.cse70 (select (select .cse72 .cse16) .cse74))) (let ((.cse73 (select (select .cse18 (select .cse19 .cse74)) (+ .cse70 4)))) (or (= .cse70 .cse71) (not (= v_DerPreprocessor_26 (select .cse72 .cse6))) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store .cse72 .cse16 v_DerPreprocessor_17) .cse73 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= .cse16 .cse73)))))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse78 (select (select .cse75 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse79 (+ .cse78 4))) (let ((.cse77 (select (select .cse75 .cse16) .cse79))) (let ((.cse76 (select (select .cse18 (select .cse19 .cse79)) (+ .cse77 4)))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (select (select (store .cse75 .cse76 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= .cse77 .cse78) (not (= v_DerPreprocessor_26 (select .cse75 .cse6))) (not (= .cse16 .cse76))))))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse80 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_prenex_21 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_21) .cse10 .cse11))) (let ((.cse81 (select (select .cse80 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse85 (+ (select (select .cse84 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse83 (select (select .cse80 .cse81) .cse85))) (let ((.cse82 (select (select .cse80 .cse83) (+ (select (select .cse84 .cse81) .cse85) 4)))) (or (= (select (select (store (store .cse80 .cse81 v_DerPreprocessor_12) .cse82 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse81 .cse82) (= .cse81 .cse83))))))) (not (= v_DerPreprocessor_27 (select .cse80 .cse6)))))) (forall ((v_DerPreprocessor_26 (Array Int Int))) (let ((.cse87 (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_26) .cse10 .cse11))) (let ((.cse89 (+ (select (select .cse87 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse86 (select .cse19 .cse89))) (let ((.cse88 (select (select .cse18 .cse86) (+ (select (select .cse87 .cse16) .cse89) 4)))) (or (= .cse16 .cse86) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (select (select (store (store .cse87 .cse16 v_DerPreprocessor_17) .cse88 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= .cse16 .cse88))))))) (forall ((v_DerPreprocessor_27 (Array Int Int))) (let ((.cse95 (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_27) .cse10 .cse12))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_20) .cse10 .cse11))) (let ((.cse93 (select (select .cse90 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse92 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse96 (+ .cse93 4))) (let ((.cse94 (select (select .cse90 .cse92) .cse96))) (let ((.cse91 (select (select .cse95 (select (select .cse95 .cse92) .cse96)) (+ .cse94 4)))) (or (= (select (select (store .cse90 .cse91 v_prenex_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= v_prenex_20 (select .cse90 .cse6))) (not (= .cse92 .cse91)) (= .cse93 .cse94)))))))) (not (= v_DerPreprocessor_27 (select .cse95 .cse6)))))))))))))) (or (not .cse1) (not .cse0) (and (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse109 (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse105 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25)) (.cse106 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse111 (+ .cse109 4))) (let ((.cse108 (select (select .cse105 .cse106) .cse111))) (let ((.cse107 (select (let ((.cse110 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24))) (select .cse110 (select (select .cse110 .cse106) .cse111))) (+ .cse108 4)))) (or (= (select (select (store (store .cse105 .cse106 v_DerPreprocessor_17) .cse107 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse107 .cse106) (= .cse108 .cse109))))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse116 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse113 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse117 (+ (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse112 (select (select .cse116 .cse113) .cse117)) (.cse115 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25))) (let ((.cse114 (select (select .cse116 .cse112) (+ (select (select .cse115 .cse113) .cse117) 4)))) (or (= .cse112 .cse113) (not (= .cse114 .cse113)) (= (select (select (store .cse115 .cse114 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse122 (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse119 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse123 (+ .cse122 4))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse121 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25) .cse119) .cse123))) (let ((.cse118 (select (select .cse120 (select (select .cse120 .cse119) .cse123)) (+ .cse121 4)))) (or (not (= .cse118 .cse119)) (= (select (select (store .cse120 .cse118 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse121 .cse122))))))) (forall ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse128 (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse129 (+ .cse128 4))) (let ((.cse126 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse127 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25) .cse125) .cse129))) (let ((.cse124 (select (select .cse126 (select (select .cse126 .cse125) .cse129)) (+ .cse127 4)))) (or (= .cse124 .cse125) (= (select (select (store (store .cse126 .cse125 v_DerPreprocessor_12) .cse124 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse127 .cse128))))))) (forall ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse131 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse134 (+ (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse130 (select (select .cse133 .cse131) .cse134))) (let ((.cse132 (select (select .cse133 .cse130) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25) .cse131) .cse134) 4)))) (or (= .cse130 .cse131) (= .cse132 .cse131) (= (select (select (store (store .cse133 .cse131 v_DerPreprocessor_12) .cse132 v_DerPreprocessor_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse139 (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25)) (.cse136 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse141 (+ .cse139 4))) (let ((.cse138 (select (select .cse137 .cse136) .cse141))) (let ((.cse135 (select (let ((.cse140 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24))) (select .cse140 (select (select .cse140 .cse136) .cse141))) (+ .cse138 4)))) (or (not (= .cse135 .cse136)) (= (select (select (store .cse137 .cse135 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse138 .cse139))))))) (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse143 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse147 (+ (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse145 (select (select .cse146 .cse143) .cse147)) (.cse142 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25))) (let ((.cse144 (select (select .cse146 .cse145) (+ (select (select .cse142 .cse143) .cse147) 4)))) (or (= (select (select (store (store .cse142 .cse143 v_DerPreprocessor_17) .cse144 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse145 .cse143) (= .cse144 .cse143)))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse151 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_24)) (.cse149 (select v_DerPreprocessor_24 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse152 (+ (select v_DerPreprocessor_25 |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse148 (select (select .cse151 .cse149) .cse152))) (let ((.cse150 (select (select .cse151 .cse148) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_25) .cse149) .cse152) 4)))) (or (= .cse148 .cse149) (not (= .cse150 .cse149)) (= (select (select (store .cse151 .cse150 v_DerPreprocessor_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))))))) is different from false [2024-11-09 04:30:13,060 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 381 DAG size of output: 370 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:30:15,707 INFO L349 Elim1Store]: treesize reduction 40, result has 60.8 percent of original size [2024-11-09 04:30:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 187 [2024-11-09 04:30:15,889 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-11-09 04:30:15,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 136 [2024-11-09 04:30:16,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2024-11-09 04:30:16,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:30:16,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 04:30:46,392 INFO L190 IndexEqualityManager]: detected not equals via solver