./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:09:57,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:09:57,314 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:09:57,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:09:57,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:09:57,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:09:57,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:09:57,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:09:57,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:09:57,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:09:57,351 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:09:57,354 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:09:57,355 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:09:57,355 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:09:57,356 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:09:57,356 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:09:57,357 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:09:57,357 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:09:57,358 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:09:57,359 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:09:57,359 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:09:57,363 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:09:57,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:09:57,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:09:57,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:09:57,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:09:57,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:09:57,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:09:57,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:09:57,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:09:57,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:09:57,368 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:09:57,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:09:57,369 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:09:57,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:09:57,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:09:57,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:09:57,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:09:57,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:09:57,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:09:57,370 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:09:57,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:09:57,372 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:09:57,372 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:09:57,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:09:57,372 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_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/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_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-11-12 00:09:57,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:09:57,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:09:57,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:09:57,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:09:57,698 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:09:57,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-12 00:10:00,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:10:01,160 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:10:01,160 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-12 00:10:01,175 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/data/1ec170dd9/f41ad5424d114bf59af8d9d5c624dcc0/FLAG17686703b [2023-11-12 00:10:01,190 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/data/1ec170dd9/f41ad5424d114bf59af8d9d5c624dcc0 [2023-11-12 00:10:01,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:10:01,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:10:01,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:01,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:10:01,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:10:01,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2a396c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01, skipping insertion in model container [2023-11-12 00:10:01,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:10:01,626 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-11-12 00:10:01,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:01,649 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:10:01,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-11-12 00:10:01,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:01,760 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:10:01,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01 WrapperNode [2023-11-12 00:10:01,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:01,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:01,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:10:01,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:10:01,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,825 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2023-11-12 00:10:01,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:01,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:10:01,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:10:01,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:10:01,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:10:01,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:10:01,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:10:01,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:10:01,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (1/1) ... [2023-11-12 00:10:01,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:10:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:01,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:10:01,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:10:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:10:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:10:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:10:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:10:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:10:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:10:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:10:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:10:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:10:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:10:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:10:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:10:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:10:01,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:10:02,131 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:10:02,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:10:02,161 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:10:02,371 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:10:02,521 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:10:02,522 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:10:02,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:02 BoogieIcfgContainer [2023-11-12 00:10:02,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:10:02,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:10:02,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:10:02,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:10:02,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:10:01" (1/3) ... [2023-11-12 00:10:02,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1aea8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:02, skipping insertion in model container [2023-11-12 00:10:02,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:01" (2/3) ... [2023-11-12 00:10:02,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1aea8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:02, skipping insertion in model container [2023-11-12 00:10:02,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:02" (3/3) ... [2023-11-12 00:10:02,534 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-11-12 00:10:02,554 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:10:02,554 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:10:02,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:10:02,610 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@204d0cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:10:02,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:10:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:10:02,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:02,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:02,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:02,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1605963889, now seen corresponding path program 1 times [2023-11-12 00:10:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:02,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406182] [2023-11-12 00:10:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:03,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:03,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406182] [2023-11-12 00:10:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:03,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:10:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057033523] [2023-11-12 00:10:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:03,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:10:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:10:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:03,169 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:03,262 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-11-12 00:10:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:10:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:03,274 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:10:03,274 INFO L226 Difference]: Without dead ends: 14 [2023-11-12 00:10:03,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:03,284 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:03,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-12 00:10:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-12 00:10:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-12 00:10:03,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2023-11-12 00:10:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:03,320 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-12 00:10:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-12 00:10:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:10:03,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:03,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:03,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:10:03,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:03,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash -328058992, now seen corresponding path program 1 times [2023-11-12 00:10:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843743256] [2023-11-12 00:10:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:03,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:03,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843743256] [2023-11-12 00:10:03,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843743256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050873150] [2023-11-12 00:10:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:03,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:03,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:03,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:10:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:03,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:10:03,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:03,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:03,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050873150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:10:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [560095895] [2023-11-12 00:10:03,921 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-12 00:10:03,922 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:10:03,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:10:03,930 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:10:03,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:10:05,304 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:10:09,535 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '144#(and (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base|) 0))) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#length_26| (Array Int Int))) (= |#length| (store |v_#length_26| |ULTIMATE.start_node_create_#res#1.base| 12))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16| Int) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| Int) (|v_#memory_int_93| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_48| (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 |ULTIMATE.start_node_create_#res#1.base|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (or (and (= (store |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select (select |v_#memory_int_49| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8)))) |v_#memory_int_49|) (= |v_#memory_$Pointer$.base_46| (store (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) |ULTIMATE.start_node_create_#res#1.base|))) (or (not (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= (store (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) 0)) |v_#memory_$Pointer$.offset_46|)) (and (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.base_46|) (= |v_#memory_int_49| |v_#memory_int_53|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16|) (= (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.offset_46|))) (= |v_#memory_int_53| (store |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_48|) (= |#memory_int| (store |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_51| (store |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 8)))) (= (store |v_#memory_int_93| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_93| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4))) |v_#memory_int_52|))))' at error location [2023-11-12 00:10:09,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:10:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:10:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-12 00:10:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246130777] [2023-11-12 00:10:09,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:10:09,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:10:09,539 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:09,628 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-11-12 00:10:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 00:10:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:09,629 INFO L225 Difference]: With dead ends: 22 [2023-11-12 00:10:09,629 INFO L226 Difference]: Without dead ends: 15 [2023-11-12 00:10:09,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:10:09,631 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-12 00:10:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-12 00:10:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-11-12 00:10:09,636 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2023-11-12 00:10:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:09,637 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-12 00:10:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-11-12 00:10:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:10:09,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:09,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:09,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:10:09,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:09,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:09,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash -853384209, now seen corresponding path program 2 times [2023-11-12 00:10:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939189342] [2023-11-12 00:10:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:10:11,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939189342] [2023-11-12 00:10:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939189342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:10:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181636175] [2023-11-12 00:10:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:11,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:10:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:10:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:10:11,009 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:11,354 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-11-12 00:10:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:10:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:10:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:11,355 INFO L225 Difference]: With dead ends: 22 [2023-11-12 00:10:11,355 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 00:10:11,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:10:11,357 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:11,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:10:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 00:10:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-11-12 00:10:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-11-12 00:10:11,363 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2023-11-12 00:10:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:11,364 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-12 00:10:11,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-11-12 00:10:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:10:11,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:11,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:11,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:10:11,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:11,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash -853336872, now seen corresponding path program 1 times [2023-11-12 00:10:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773530258] [2023-11-12 00:10:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:10:11,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773530258] [2023-11-12 00:10:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773530258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:10:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449002482] [2023-11-12 00:10:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:11,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:11,585 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:11,723 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-12 00:10:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:10:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:11,725 INFO L225 Difference]: With dead ends: 20 [2023-11-12 00:10:11,725 INFO L226 Difference]: Without dead ends: 17 [2023-11-12 00:10:11,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:11,727 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-12 00:10:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-12 00:10:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-11-12 00:10:11,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2023-11-12 00:10:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:11,733 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-12 00:10:11,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-11-12 00:10:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:10:11,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:11,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:11,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:10:11,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:10:11,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash 236563562, now seen corresponding path program 1 times [2023-11-12 00:10:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731242418] [2023-11-12 00:10:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:13,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731242418] [2023-11-12 00:10:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731242418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:10:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407125225] [2023-11-12 00:10:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:10:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:13,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:10:13,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c53b28ed-c849-44e4-8817-ce1a98efab79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:10:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:14,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-12 00:10:14,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:10:14,082 INFO L351 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 [2023-11-12 00:10:14,239 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:10:14,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:10:14,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-12 00:10:14,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-12 00:10:14,424 INFO L351 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 38 treesize of output 22 [2023-11-12 00:10:14,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-11-12 00:10:14,613 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-12 00:10:14,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-12 00:10:15,274 INFO L322 Elim1Store]: treesize reduction 827, result has 2.6 percent of original size [2023-11-12 00:10:15,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 641 treesize of output 843 [2023-11-12 00:10:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,414 INFO L322 Elim1Store]: treesize reduction 46, result has 23.3 percent of original size [2023-11-12 00:10:15,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 501 treesize of output 494 [2023-11-12 00:10:15,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 105 [2023-11-12 00:10:15,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 93 [2023-11-12 00:10:15,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,503 INFO L322 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2023-11-12 00:10:15,503 INFO L351 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 3 case distinctions, treesize of input 166 treesize of output 128 [2023-11-12 00:10:15,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 24 [2023-11-12 00:10:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2023-11-12 00:10:15,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-12 00:10:15,552 INFO L351 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 14 treesize of output 13 [2023-11-12 00:10:15,561 INFO L351 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 65 treesize of output 41 [2023-11-12 00:10:15,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,572 INFO L351 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 37 treesize of output 22 [2023-11-12 00:10:15,586 INFO L351 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 34 treesize of output 19 [2023-11-12 00:10:15,596 INFO L351 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 [2023-11-12 00:10:15,743 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:15,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 39 [2023-11-12 00:10:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:10:15,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 00:10:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:15,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:10:16,972 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse7 (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse1 (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)))))) (forall ((v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_7 Int) (v_ArrVal_497 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse9 (select (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse9 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse11 (select (select .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse15 (let ((.cse18 (store .cse19 .cse11 v_DerPreprocessor_6))) (store .cse18 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse12 (let ((.cse16 (store .cse17 .cse11 v_DerPreprocessor_5))) (store .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_507))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ .cse9 8) v_DerPreprocessor_7))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse12 .cse13) .cse14)) (select (select .cse15 .cse13) .cse14))))))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_497 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_497 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse20 (select (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse20 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_503 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse26 (let ((.cse29 (store .cse22 .cse20 v_DerPreprocessor_2))) (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse23 (let ((.cse27 (store .cse28 .cse20 v_DerPreprocessor_1))) (store .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (+ (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_507))) (store .cse21 .cse20 (store (select .cse21 .cse20) (+ (select (select .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_508) (select (select .cse23 .cse24) .cse25)) (select (select .cse26 .cse24) .cse25)))))))))))) is different from false [2023-11-12 00:10:19,161 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-12 00:10:19,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 123 [2023-11-12 00:10:19,213 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-12 00:10:19,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 89 [2023-11-12 00:10:19,263 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-12 00:10:19,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 80 [2023-11-12 00:10:19,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:10:19,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:10:19,309 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:19,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 8 [2023-11-12 00:10:42,669 WARN L293 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 30 DAG size of output: 17 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-12 00:10:42,669 INFO L322 Elim1Store]: treesize reduction 44, result has 31.3 percent of original size [2023-11-12 00:10:42,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31230 treesize of output 29567 [2023-11-12 00:10:42,807 INFO L351 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 3209 treesize of output 3201 [2023-11-12 00:10:42,855 INFO L351 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 3245 treesize of output 3181 [2023-11-12 00:10:50,052 WARN L293 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-12 00:10:50,052 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:50,053 INFO L351 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 3260 treesize of output 3187 [2023-11-12 00:10:50,146 INFO L351 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 3226 treesize of output 3222 [2023-11-12 00:10:50,267 INFO L351 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 3410 treesize of output 3402 [2023-11-12 00:10:59,024 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-12 00:10:59,025 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:10:59,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48428 treesize of output 45254 [2023-11-12 00:10:59,240 INFO L351 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 5224 treesize of output 5216