./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/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_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:45:44,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:45:44,538 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:45:44,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:45:44,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:45:44,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:45:44,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:45:44,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:45:44,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:45:44,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:45:44,576 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:45:44,576 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:45:44,577 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:45:44,578 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:45:44,578 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:45:44,579 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:45:44,579 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:45:44,580 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:45:44,581 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:45:44,581 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:45:44,582 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:45:44,582 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:45:44,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:45:44,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:45:44,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:45:44,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:45:44,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:45:44,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:45:44,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:45:44,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:45:44,587 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:45:44,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:45:44,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:45:44,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:45:44,589 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:45:44,589 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:45:44,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:45:44,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:45:44,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:45:44,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:45:44,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:45:44,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:45:44,592 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:45:44,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:45:44,593 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:45:44,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:45:44,593 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_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/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_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-11-12 00:45:44,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:45:44,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:45:44,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:45:44,946 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:45:44,948 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:45:44,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-12 00:45:48,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:45:48,400 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:45:48,401 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-12 00:45:48,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/data/1e01bf703/28988676798c48f59ab4984476687565/FLAG47a0ec29c [2023-11-12 00:45:48,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/data/1e01bf703/28988676798c48f59ab4984476687565 [2023-11-12 00:45:48,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:45:48,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:45:48,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:45:48,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:45:48,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:45:48,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:48" (1/1) ... [2023-11-12 00:45:48,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384e1998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:48, skipping insertion in model container [2023-11-12 00:45:48,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:48" (1/1) ... [2023-11-12 00:45:48,504 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:45:48,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:45:48,978 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:45:49,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:45:49,094 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:45:49,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49 WrapperNode [2023-11-12 00:45:49,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:45:49,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:45:49,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:45:49,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:45:49,105 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:45:49" (1/1) ... [2023-11-12 00:45:49,131 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:45:49" (1/1) ... [2023-11-12 00:45:49,173 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 170 [2023-11-12 00:45:49,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:45:49,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:45:49,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:45:49,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:45:49,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:45:49,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:45:49,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:45:49,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:45:49,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (1/1) ... [2023-11-12 00:45:49,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:45:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:45:49,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/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:45:49,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/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:45:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:45:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:45:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:45:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:45:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:45:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:45:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:45:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:45:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:45:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:45:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:45:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:45:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:45:49,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:45:49,476 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:45:49,478 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:45:49,978 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:45:50,113 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:45:50,113 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:45:50,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:50 BoogieIcfgContainer [2023-11-12 00:45:50,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:45:50,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:45:50,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:45:50,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:45:50,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:45:48" (1/3) ... [2023-11-12 00:45:50,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:50, skipping insertion in model container [2023-11-12 00:45:50,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:49" (2/3) ... [2023-11-12 00:45:50,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:50, skipping insertion in model container [2023-11-12 00:45:50,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:50" (3/3) ... [2023-11-12 00:45:50,135 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-11-12 00:45:50,156 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:45:50,157 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-11-12 00:45:50,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:45:50,225 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@a79fd78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:45:50,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-11-12 00:45:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 55 states have (on average 2.327272727272727) internal successors, (128), 113 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:50,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:50,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:50,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:50,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 255306079, now seen corresponding path program 1 times [2023-11-12 00:45:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:50,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588237120] [2023-11-12 00:45:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:50,619 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:45:50,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588237120] [2023-11-12 00:45:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588237120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:50,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184768595] [2023-11-12 00:45:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:50,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:50,682 INFO L87 Difference]: Start difference. First operand has 118 states, 55 states have (on average 2.327272727272727) internal successors, (128), 113 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:45:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:50,934 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2023-11-12 00:45:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:45:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:50,947 INFO L225 Difference]: With dead ends: 115 [2023-11-12 00:45:50,947 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 00:45:50,950 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:45:50,955 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:50,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:45:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 00:45:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-12 00:45:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 53 states have (on average 2.207547169811321) internal successors, (117), 108 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2023-11-12 00:45:51,007 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 5 [2023-11-12 00:45:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:51,007 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2023-11-12 00:45:51,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:45:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2023-11-12 00:45:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:51,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:51,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:51,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:45:51,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:51,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 255306080, now seen corresponding path program 1 times [2023-11-12 00:45:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043137390] [2023-11-12 00:45:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:51,173 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:45:51,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043137390] [2023-11-12 00:45:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043137390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220669090] [2023-11-12 00:45:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:51,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:51,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:51,198 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:45:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:51,336 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-11-12 00:45:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:45:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:51,339 INFO L225 Difference]: With dead ends: 111 [2023-11-12 00:45:51,339 INFO L226 Difference]: Without dead ends: 111 [2023-11-12 00:45:51,339 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:45:51,341 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:51,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:45:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-12 00:45:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-12 00:45:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.169811320754717) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2023-11-12 00:45:51,353 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 5 [2023-11-12 00:45:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:51,354 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2023-11-12 00:45:51,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:45:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2023-11-12 00:45:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:45:51,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:51,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:51,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:45:51,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:51,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -337147536, now seen corresponding path program 1 times [2023-11-12 00:45:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:51,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605192807] [2023-11-12 00:45:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:51,432 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:45:51,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605192807] [2023-11-12 00:45:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605192807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:51,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:51,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:45:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291512248] [2023-11-12 00:45:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:51,436 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:45:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:51,480 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-11-12 00:45:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-12 00:45:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:51,482 INFO L225 Difference]: With dead ends: 117 [2023-11-12 00:45:51,482 INFO L226 Difference]: Without dead ends: 117 [2023-11-12 00:45:51,483 INFO L412 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 [2023-11-12 00:45:51,484 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:51,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 206 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:45:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-12 00:45:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2023-11-12 00:45:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.1481481481481484) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2023-11-12 00:45:51,497 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 10 [2023-11-12 00:45:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:51,497 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2023-11-12 00:45:51,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:45:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2023-11-12 00:45:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:45:51,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:51,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:51,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:45:51,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:51,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1082230534, now seen corresponding path program 1 times [2023-11-12 00:45:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862733309] [2023-11-12 00:45:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:45:51,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862733309] [2023-11-12 00:45:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862733309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:51,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:51,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:45:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915054035] [2023-11-12 00:45:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:45:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:45:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:45:51,712 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:45:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:51,957 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-11-12 00:45:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:45:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-12 00:45:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:51,960 INFO L225 Difference]: With dead ends: 111 [2023-11-12 00:45:51,960 INFO L226 Difference]: Without dead ends: 111 [2023-11-12 00:45:51,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:45:51,962 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:51,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 328 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:45:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-12 00:45:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-12 00:45:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 106 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2023-11-12 00:45:51,972 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 17 [2023-11-12 00:45:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:51,973 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2023-11-12 00:45:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:45:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2023-11-12 00:45:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:45:51,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:51,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:45:51,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1082230535, now seen corresponding path program 1 times [2023-11-12 00:45:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665420387] [2023-11-12 00:45:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:52,197 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:45:52,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665420387] [2023-11-12 00:45:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665420387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:52,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:45:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24764029] [2023-11-12 00:45:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:45:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:45:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:45:52,203 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:45:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:52,442 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2023-11-12 00:45:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:45:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-12 00:45:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:52,445 INFO L225 Difference]: With dead ends: 110 [2023-11-12 00:45:52,445 INFO L226 Difference]: Without dead ends: 110 [2023-11-12 00:45:52,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:45:52,447 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:52,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 352 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:45:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-12 00:45:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-12 00:45:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.111111111111111) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-11-12 00:45:52,456 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2023-11-12 00:45:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:52,457 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-11-12 00:45:52,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:45:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-11-12 00:45:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:45:52,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:52,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:45:52,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:52,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 641683401, now seen corresponding path program 1 times [2023-11-12 00:45:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563722546] [2023-11-12 00:45:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:45:52,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563722546] [2023-11-12 00:45:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563722546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:45:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515578305] [2023-11-12 00:45:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:45:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:45:52,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:45:52,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:45:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:52,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 00:45:52,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:45:52,977 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 6 treesize of output 5 [2023-11-12 00:45:53,048 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:45:53,106 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:45:53,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 00:45:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-12 00:45:53,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:45:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515578305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:45:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131171907] [2023-11-12 00:45:53,240 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:45:53,240 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:45:53,247 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:45:53,254 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:45:53,254 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:45:54,873 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:45:55,005 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:45:57,226 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1348#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-12 00:45:57,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:45:57,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:45:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-11-12 00:45:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270701060] [2023-11-12 00:45:57,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:45:57,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:45:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:45:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-11-12 00:45:57,229 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:45:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:57,619 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-11-12 00:45:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:45:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-12 00:45:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:57,621 INFO L225 Difference]: With dead ends: 109 [2023-11-12 00:45:57,621 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:45:57,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2023-11-12 00:45:57,622 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:57,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 420 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2023-11-12 00:45:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:45:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-12 00:45:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:45:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-11-12 00:45:57,634 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 19 [2023-11-12 00:45:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-11-12 00:45:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:45:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-11-12 00:45:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:45:57,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:57,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:57,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:45:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:45:57,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:45:57,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 641683402, now seen corresponding path program 1 times [2023-11-12 00:45:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178312030] [2023-11-12 00:45:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:58,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178312030] [2023-11-12 00:45:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178312030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:45:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521196638] [2023-11-12 00:45:58,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:45:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:45:58,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:45:58,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:45:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:58,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:45:58,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:45:58,469 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 8 treesize of output 1 [2023-11-12 00:45:58,475 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 6 treesize of output 5 [2023-11-12 00:45:58,682 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:45:58,682 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 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-12 00:45:58,704 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:45:58,705 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 11 treesize of output 11 [2023-11-12 00:45:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:58,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:45:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521196638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:45:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1479573641] [2023-11-12 00:45:58,933 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:45:58,933 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:45:58,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:45:58,934 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:45:58,934 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:00,015 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:46:00,146 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:03,047 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1671#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-12 00:46:03,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:46:03,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:46:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-11-12 00:46:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525508832] [2023-11-12 00:46:03,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:46:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:46:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:46:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-11-12 00:46:03,051 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:46:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:03,962 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2023-11-12 00:46:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:46:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-12 00:46:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:03,964 INFO L225 Difference]: With dead ends: 110 [2023-11-12 00:46:03,965 INFO L226 Difference]: Without dead ends: 110 [2023-11-12 00:46:03,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2023-11-12 00:46:03,969 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:03,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 644 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:46:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-12 00:46:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-12 00:46:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 54 states have (on average 2.074074074074074) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2023-11-12 00:46:03,987 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 19 [2023-11-12 00:46:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:03,988 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2023-11-12 00:46:03,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:46:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2023-11-12 00:46:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:46:03,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:03,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:04,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:04,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:46:04,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:04,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1061071089, now seen corresponding path program 1 times [2023-11-12 00:46:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322339116] [2023-11-12 00:46:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:46:04,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322339116] [2023-11-12 00:46:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322339116] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063777682] [2023-11-12 00:46:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:04,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:04,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:46:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:05,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 00:46:05,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:05,101 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 6 treesize of output 5 [2023-11-12 00:46:05,111 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 5 treesize of output 3 [2023-11-12 00:46:05,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:05,179 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 14 treesize of output 9 [2023-11-12 00:46:05,221 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 5 treesize of output 3 [2023-11-12 00:46:05,230 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 00:46:05,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:05,257 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 14 treesize of output 9 [2023-11-12 00:46:05,277 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 00:46:05,295 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:46:05,296 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 00:46:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2023-11-12 00:46:05,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:05,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063777682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:05,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733191002] [2023-11-12 00:46:05,595 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:46:05,595 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:05,596 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:05,596 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:05,596 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:06,858 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:46:06,883 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:09,759 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2043#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (or (and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1))) (exists ((|v_#length_122| (Array Int Int))) (= |#length| (store |v_#length_122| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#valid_147| (Array Int Int))) (and (= (store |v_#valid_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_86| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_87|) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_122| (Array Int Int))) (= |#length| (store |v_#length_122| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#valid_147| (Array Int Int))) (and (= (store |v_#valid_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 1) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_86| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_87|) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 5))' at error location [2023-11-12 00:46:09,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:46:09,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:46:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2023-11-12 00:46:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283560291] [2023-11-12 00:46:09,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:46:09,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:46:09,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:09,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:46:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=886, Unknown=11, NotChecked=122, Total=1122 [2023-11-12 00:46:09,763 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 00:46:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:10,563 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2023-11-12 00:46:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:46:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2023-11-12 00:46:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:10,565 INFO L225 Difference]: With dead ends: 116 [2023-11-12 00:46:10,565 INFO L226 Difference]: Without dead ends: 116 [2023-11-12 00:46:10,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=131, Invalid=1055, Unknown=12, NotChecked=134, Total=1332 [2023-11-12 00:46:10,567 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 125 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:10,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 538 Invalid, 0 Unknown, 244 Unchecked, 0.6s Time] [2023-11-12 00:46:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-12 00:46:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2023-11-12 00:46:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2023-11-12 00:46:10,581 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 27 [2023-11-12 00:46:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:10,582 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2023-11-12 00:46:10,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 00:46:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2023-11-12 00:46:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:46:10,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:10,584 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:10,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:46:10,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:10,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1061071088, now seen corresponding path program 1 times [2023-11-12 00:46:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535230392] [2023-11-12 00:46:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:46:11,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535230392] [2023-11-12 00:46:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535230392] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713451783] [2023-11-12 00:46:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:11,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:11,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:11,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:46:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:11,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:46:11,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:11,837 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 8 treesize of output 1 [2023-11-12 00:46:11,847 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 5 treesize of output 3 [2023-11-12 00:46:11,855 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-12 00:46:11,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:11,882 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 14 treesize of output 9 [2023-11-12 00:46:11,909 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 5 treesize of output 3 [2023-11-12 00:46:11,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:11,941 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 14 treesize of output 9 [2023-11-12 00:46:11,983 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 5 treesize of output 3 [2023-11-12 00:46:12,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:12,018 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 14 treesize of output 9 [2023-11-12 00:46:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:46:12,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:46:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713451783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:46:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-11-12 00:46:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175281086] [2023-11-12 00:46:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:12,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:46:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:12,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:46:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-12 00:46:12,028 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:12,260 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2023-11-12 00:46:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:46:12,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-12 00:46:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:12,262 INFO L225 Difference]: With dead ends: 94 [2023-11-12 00:46:12,262 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 00:46:12,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-12 00:46:12,264 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:12,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 250 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 125 Unchecked, 0.2s Time] [2023-11-12 00:46:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 00:46:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 00:46:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-11-12 00:46:12,269 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 27 [2023-11-12 00:46:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:12,269 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-11-12 00:46:12,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-11-12 00:46:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:46:12,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:12,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:12,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:12,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:12,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:12,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1782067184, now seen corresponding path program 1 times [2023-11-12 00:46:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:12,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694036746] [2023-11-12 00:46:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:46:12,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694036746] [2023-11-12 00:46:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694036746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:46:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349176600] [2023-11-12 00:46:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:12,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:46:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:46:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:46:12,639 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:46:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:12,837 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-12 00:46:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:46:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-11-12 00:46:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:12,839 INFO L225 Difference]: With dead ends: 92 [2023-11-12 00:46:12,839 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 00:46:12,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:46:12,840 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:12,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 257 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:46:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 00:46:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-12 00:46:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-11-12 00:46:12,846 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 29 [2023-11-12 00:46:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:12,846 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-11-12 00:46:12,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:46:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-11-12 00:46:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:46:12,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:12,850 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:46:12,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:12,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1782067183, now seen corresponding path program 1 times [2023-11-12 00:46:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201435059] [2023-11-12 00:46:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:46:13,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:13,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201435059] [2023-11-12 00:46:13,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201435059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:13,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:46:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705055625] [2023-11-12 00:46:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:46:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:46:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:46:13,132 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:46:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:13,361 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2023-11-12 00:46:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:46:13,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-11-12 00:46:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:13,363 INFO L225 Difference]: With dead ends: 90 [2023-11-12 00:46:13,363 INFO L226 Difference]: Without dead ends: 90 [2023-11-12 00:46:13,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:46:13,364 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:13,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 265 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:46:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-12 00:46:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-12 00:46:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2023-11-12 00:46:13,369 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 29 [2023-11-12 00:46:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:13,369 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2023-11-12 00:46:13,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:46:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2023-11-12 00:46:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:46:13,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:13,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:46:13,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:13,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 590506148, now seen corresponding path program 1 times [2023-11-12 00:46:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:13,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478342697] [2023-11-12 00:46:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:46:14,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:14,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478342697] [2023-11-12 00:46:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478342697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600884959] [2023-11-12 00:46:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:14,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:14,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:46:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:14,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-12 00:46:14,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:14,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-12 00:46:14,673 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:46:14,710 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-12 00:46:14,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-12 00:46:14,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:14,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-12 00:46:14,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-12 00:46:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:46:14,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:46:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600884959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:46:14,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-11-12 00:46:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581848122] [2023-11-12 00:46:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:46:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:46:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2023-11-12 00:46:14,775 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:15,306 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2023-11-12 00:46:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:46:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-11-12 00:46:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:15,308 INFO L225 Difference]: With dead ends: 93 [2023-11-12 00:46:15,308 INFO L226 Difference]: Without dead ends: 93 [2023-11-12 00:46:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=473, Unknown=1, NotChecked=44, Total=600 [2023-11-12 00:46:15,310 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:15,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 272 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2023-11-12 00:46:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-12 00:46:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-11-12 00:46:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.709090909090909) internal successors, (94), 84 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-11-12 00:46:15,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 30 [2023-11-12 00:46:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:15,316 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-11-12 00:46:15,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-11-12 00:46:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:46:15,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:15,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:15,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:46:15,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:15,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 590506149, now seen corresponding path program 1 times [2023-11-12 00:46:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260782454] [2023-11-12 00:46:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:46:16,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260782454] [2023-11-12 00:46:16,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260782454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962015294] [2023-11-12 00:46:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:16,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:16,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:46:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:16,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-12 00:46:16,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:16,971 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 6 treesize of output 5 [2023-11-12 00:46:17,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-12 00:46:17,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-12 00:46:17,333 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:46:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:17,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-12 00:46:17,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:17,365 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 24 treesize of output 19 [2023-11-12 00:46:17,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:17,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-12 00:46:17,386 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:46:17,386 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 15 treesize of output 15 [2023-11-12 00:46:17,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-12 00:46:17,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-12 00:46:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-12 00:46:17,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962015294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103612070] [2023-11-12 00:46:17,814 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:46:17,814 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:17,815 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:17,815 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:17,815 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:19,140 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:46:19,163 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:46:24,315 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3372#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (or (< |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (exists ((|v_#valid_158| (Array Int Int))) (and (= (select |v_#valid_158| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_158| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#length_136| (Array Int Int))) (= |#length| (store |v_#length_136| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))) (= |v_#memory_int_99| (store |v_#memory_int_98| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_98| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_52| (Array Int Int)) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= 4 (select |v_old(#length)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= |v_old(#memory_int)_AFTER_CALL_52| (store |v_#memory_int_102| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_102| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (exists ((|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_135| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_135| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#valid_158| (Array Int Int))) (and (= (select |v_#valid_158| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_158| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#length_136| (Array Int Int))) (= |#length| (store |v_#length_136| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_99| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 5))) (= |v_#memory_int_99| (store |v_#memory_int_98| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_98| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_99| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_135| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_135| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_51| (Array Int Int)) (|v_#length_BEFORE_CALL_88| (Array Int Int)) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_51| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_51| (store |v_#memory_int_102| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_102| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_139| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_51| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (<= 4 (select |v_#length_BEFORE_CALL_88| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 5))' at error location [2023-11-12 00:46:24,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:46:24,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:46:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2023-11-12 00:46:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347839988] [2023-11-12 00:46:24,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:46:24,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 00:46:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 00:46:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1907, Unknown=14, NotChecked=88, Total=2162 [2023-11-12 00:46:24,320 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:46:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:25,910 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2023-11-12 00:46:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:46:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 00:46:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:25,913 INFO L225 Difference]: With dead ends: 96 [2023-11-12 00:46:25,913 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 00:46:25,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=234, Invalid=2833, Unknown=17, NotChecked=108, Total=3192 [2023-11-12 00:46:25,915 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 224 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:25,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 611 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1010 Invalid, 0 Unknown, 107 Unchecked, 1.0s Time] [2023-11-12 00:46:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 00:46:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2023-11-12 00:46:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 88 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2023-11-12 00:46:25,921 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 30 [2023-11-12 00:46:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:25,922 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2023-11-12 00:46:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:46:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2023-11-12 00:46:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:46:25,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:25,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:25,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:46:26,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 00:46:26,124 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:26,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash 527278588, now seen corresponding path program 1 times [2023-11-12 00:46:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009984411] [2023-11-12 00:46:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:46:26,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009984411] [2023-11-12 00:46:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009984411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:26,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:26,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:46:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240758747] [2023-11-12 00:46:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:26,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:46:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:46:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:46:26,393 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:26,565 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-12 00:46:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:46:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-12 00:46:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:26,566 INFO L225 Difference]: With dead ends: 89 [2023-11-12 00:46:26,567 INFO L226 Difference]: Without dead ends: 89 [2023-11-12 00:46:26,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:46:26,567 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 142 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:26,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 196 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:46:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-12 00:46:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-12 00:46:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 84 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-11-12 00:46:26,573 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 32 [2023-11-12 00:46:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:26,573 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-11-12 00:46:26,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-11-12 00:46:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:46:26,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:26,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:26,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:46:26,576 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:26,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash -91265399, now seen corresponding path program 1 times [2023-11-12 00:46:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856591469] [2023-11-12 00:46:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:46:26,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856591469] [2023-11-12 00:46:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856591469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:46:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379077328] [2023-11-12 00:46:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:46:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:46:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:46:26,927 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:27,290 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2023-11-12 00:46:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:46:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-12 00:46:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:27,292 INFO L225 Difference]: With dead ends: 156 [2023-11-12 00:46:27,293 INFO L226 Difference]: Without dead ends: 156 [2023-11-12 00:46:27,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:46:27,294 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 161 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:27,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 314 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:46:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-12 00:46:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2023-11-12 00:46:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2023-11-12 00:46:27,299 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 34 [2023-11-12 00:46:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:27,299 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2023-11-12 00:46:27,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2023-11-12 00:46:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:46:27,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:27,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:46:27,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:27,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -91265398, now seen corresponding path program 1 times [2023-11-12 00:46:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303123381] [2023-11-12 00:46:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:46:27,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303123381] [2023-11-12 00:46:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303123381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:46:27,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:46:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 00:46:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667120450] [2023-11-12 00:46:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:46:27,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:46:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:46:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:46:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:46:27,761 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 9 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:46:28,104 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2023-11-12 00:46:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:46:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-12 00:46:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:46:28,106 INFO L225 Difference]: With dead ends: 182 [2023-11-12 00:46:28,106 INFO L226 Difference]: Without dead ends: 182 [2023-11-12 00:46:28,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:46:28,107 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:46:28,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 355 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:46:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-12 00:46:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 95. [2023-11-12 00:46:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:46:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-11-12 00:46:28,113 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 34 [2023-11-12 00:46:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:46:28,114 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-11-12 00:46:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:46:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-11-12 00:46:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:46:28,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:46:28,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:46:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 00:46:28,117 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-12 00:46:28,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:46:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -53355367, now seen corresponding path program 1 times [2023-11-12 00:46:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:46:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033266676] [2023-11-12 00:46:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:46:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:46:29,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:46:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033266676] [2023-11-12 00:46:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033266676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826074877] [2023-11-12 00:46:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:46:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:46:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:46:29,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:46:29,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3d018fc-0adc-4c1a-90a8-b34749f0e31b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:46:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:46:29,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-12 00:46:29,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:46:29,920 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 6 treesize of output 5 [2023-11-12 00:46:30,121 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:46:30,121 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 11 treesize of output 11 [2023-11-12 00:46:30,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:46:30,359 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-12 00:46:30,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-12 00:46:30,437 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:46:30,438 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-12 00:46:30,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-12 00:46:30,585 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:46:30,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:30,627 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 00:46:30,627 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 2 case distinctions, treesize of input 47 treesize of output 38 [2023-11-12 00:46:30,675 INFO L322 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-11-12 00:46:30,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-11-12 00:46:30,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:46:30,688 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 16 treesize of output 11 [2023-11-12 00:46:30,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:46:30,928 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:46:30,929 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-11-12 00:46:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:46:30,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:46:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826074877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:46:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2037662705] [2023-11-12 00:46:31,213 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-12 00:46:31,213 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:46:31,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:46:31,213 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:46:31,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:46:33,079 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:46:33,102 INFO L180 IcfgInterpreter]: Interpretation finished