./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_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_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/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_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/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_ac141230-f5da-4be0-bde8-147468dc87d4/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:41:55,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:41:56,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:41:56,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:41:56,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:41:56,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:41:56,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:41:56,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:41:56,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:41:56,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:41:56,074 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:41:56,074 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:41:56,074 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:41:56,076 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:41:56,077 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:41:56,077 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:41:56,078 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:41:56,078 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:41:56,078 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:41:56,079 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:41:56,079 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:41:56,080 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:41:56,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:41:56,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:41:56,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:41:56,083 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:41:56,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:41:56,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:41:56,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:41:56,084 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:41:56,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:41:56,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:41:56,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:41:56,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:41:56,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:41:56,087 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:41:56,087 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:41:56,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:41:56,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:41:56,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:41:56,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:41:56,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:41:56,090 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:41:56,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:41:56,091 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:41:56,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:41:56,092 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_ac141230-f5da-4be0-bde8-147468dc87d4/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_ac141230-f5da-4be0-bde8-147468dc87d4/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-12 00:41:56,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:41:56,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:41:56,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:41:56,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:41:56,387 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:41:56,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-12 00:41:59,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:41:59,851 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:41:59,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-12 00:41:59,870 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/data/933026912/08f9b0e45e5449c59878a55db8cfa0cc/FLAGb95468e80 [2023-11-12 00:41:59,885 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/data/933026912/08f9b0e45e5449c59878a55db8cfa0cc [2023-11-12 00:41:59,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:41:59,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:41:59,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:41:59,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:41:59,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:41:59,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:41:59" (1/1) ... [2023-11-12 00:41:59,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295844ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:59, skipping insertion in model container [2023-11-12 00:41:59,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:41:59" (1/1) ... [2023-11-12 00:41:59,980 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:42:00,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:42:00,387 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:42:00,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:42:00,483 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:42:00,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00 WrapperNode [2023-11-12 00:42:00,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:42:00,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:42:00,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:42:00,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:42:00,492 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:42:00" (1/1) ... [2023-11-12 00:42:00,507 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:42:00" (1/1) ... [2023-11-12 00:42:00,538 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 183 [2023-11-12 00:42:00,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:42:00,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:42:00,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:42:00,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:42:00,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:42:00,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:42:00,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:42:00,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:42:00,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (1/1) ... [2023-11-12 00:42:00,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:42:00,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:00,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/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:42:00,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/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:42:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:42:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:42:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:42:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:42:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:42:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:42:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:42:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:42:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:42:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:42:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:42:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:42:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:42:00,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:42:00,900 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:42:00,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:42:01,497 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:42:01,559 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:42:01,560 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:42:01,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:01 BoogieIcfgContainer [2023-11-12 00:42:01,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:42:01,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:42:01,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:42:01,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:42:01,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:41:59" (1/3) ... [2023-11-12 00:42:01,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e58c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:01, skipping insertion in model container [2023-11-12 00:42:01,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:00" (2/3) ... [2023-11-12 00:42:01,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e58c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:01, skipping insertion in model container [2023-11-12 00:42:01,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:01" (3/3) ... [2023-11-12 00:42:01,574 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-12 00:42:01,593 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:42:01,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-12 00:42:01,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:42:01,650 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;@52e81be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:42:01,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-11-12 00:42:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 states have internal predecessors, (137), 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:42:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:42:01,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:01,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:42:01,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:01,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash 271590832, now seen corresponding path program 1 times [2023-11-12 00:42:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576355045] [2023-11-12 00:42:01,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:01,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:01,972 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:42:01,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576355045] [2023-11-12 00:42:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576355045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:01,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:42:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585006541] [2023-11-12 00:42:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:01,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:02,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:02,012 INFO L87 Difference]: Start difference. First operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 states have internal predecessors, (137), 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:42:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:02,177 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-11-12 00:42:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:02,180 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:42:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:02,189 INFO L225 Difference]: With dead ends: 123 [2023-11-12 00:42:02,190 INFO L226 Difference]: Without dead ends: 121 [2023-11-12 00:42:02,191 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:42:02,195 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:02,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-12 00:42:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-12 00:42:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 116 states have internal predecessors, (127), 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:42:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2023-11-12 00:42:02,243 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 5 [2023-11-12 00:42:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:02,244 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2023-11-12 00:42:02,244 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:42:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2023-11-12 00:42:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:42:02,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:02,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:42:02,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:42:02,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:02,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 271590833, now seen corresponding path program 1 times [2023-11-12 00:42:02,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:02,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012120380] [2023-11-12 00:42:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:02,381 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:42:02,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012120380] [2023-11-12 00:42:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012120380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:42:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239077591] [2023-11-12 00:42:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:02,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:02,386 INFO L87 Difference]: Start difference. First operand 121 states and 133 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:42:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:02,575 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-12 00:42:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:02,575 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:42:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:02,583 INFO L225 Difference]: With dead ends: 119 [2023-11-12 00:42:02,584 INFO L226 Difference]: Without dead ends: 119 [2023-11-12 00:42:02,585 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:42:02,590 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:02,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:42:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-12 00:42:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-12 00:42:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.192982456140351) internal successors, (125), 114 states have internal predecessors, (125), 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:42:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-12 00:42:02,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 5 [2023-11-12 00:42:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:02,617 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-12 00:42:02,617 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:42:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-12 00:42:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:42:02,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:02,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:02,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:42:02,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:02,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -366380054, now seen corresponding path program 1 times [2023-11-12 00:42:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424610143] [2023-11-12 00:42:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:02,736 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:42:02,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424610143] [2023-11-12 00:42:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424610143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955255216] [2023-11-12 00:42:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:02,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:02,741 INFO L87 Difference]: Start difference. First operand 119 states and 131 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:42:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:02,788 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-12 00:42:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:02,788 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:42:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:02,790 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:42:02,790 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:42:02,791 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:42:02,792 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:02,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:42:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-12 00:42:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 115 states have internal predecessors, (126), 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:42:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-12 00:42:02,804 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 10 [2023-11-12 00:42:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:02,805 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-12 00:42:02,806 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:42:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-12 00:42:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:42:02,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:02,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:02,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:42:02,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:02,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash -544533673, now seen corresponding path program 1 times [2023-11-12 00:42:02,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:02,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094351554] [2023-11-12 00:42:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:02,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:03,022 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:42:03,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094351554] [2023-11-12 00:42:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094351554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162998272] [2023-11-12 00:42:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:03,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:42:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:42:03,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:42:03,028 INFO L87 Difference]: Start difference. First operand 120 states and 132 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:42:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:03,308 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-12 00:42:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:42:03,309 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:42:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:03,311 INFO L225 Difference]: With dead ends: 119 [2023-11-12 00:42:03,311 INFO L226 Difference]: Without dead ends: 119 [2023-11-12 00:42:03,311 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:42:03,322 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:03,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 356 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:42:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-12 00:42:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-12 00:42:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 114 states have internal predecessors, (125), 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:42:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-12 00:42:03,335 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 17 [2023-11-12 00:42:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:03,335 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-12 00:42:03,335 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:42:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-12 00:42:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:42:03,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:03,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:03,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:42:03,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:03,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash -544533672, now seen corresponding path program 1 times [2023-11-12 00:42:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942521955] [2023-11-12 00:42:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:03,673 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:42:03,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942521955] [2023-11-12 00:42:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942521955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672101996] [2023-11-12 00:42:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:42:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:42:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:42:03,679 INFO L87 Difference]: Start difference. First operand 119 states and 131 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:42:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:03,955 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2023-11-12 00:42:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:42:03,956 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:42:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:03,957 INFO L225 Difference]: With dead ends: 118 [2023-11-12 00:42:03,958 INFO L226 Difference]: Without dead ends: 118 [2023-11-12 00:42:03,958 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:42:03,959 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:03,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:42:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-12 00:42:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-12 00:42:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 113 states have internal predecessors, (124), 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:42:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-11-12 00:42:03,988 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 17 [2023-11-12 00:42:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:03,988 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-11-12 00:42:03,989 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:42:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-11-12 00:42:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:42:03,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:03,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:03,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:42:03,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:03,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:03,992 INFO L85 PathProgramCache]: Analyzing trace with hash 689394167, now seen corresponding path program 1 times [2023-11-12 00:42:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:03,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884664554] [2023-11-12 00:42:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:04,327 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:42:04,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884664554] [2023-11-12 00:42:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884664554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394198279] [2023-11-12 00:42:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:04,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:04,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:42:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:04,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:42:04,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:04,551 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:42:04,624 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:42:04,624 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:42:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:04,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394198279] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:42:04,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717253200] [2023-11-12 00:42:05,004 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:42:05,005 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:05,009 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:05,015 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:05,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:06,746 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:42:06,920 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:09,056 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1476#(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:42:09,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:09,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:42:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-11-12 00:42:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895127737] [2023-11-12 00:42:09,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:09,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:42:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:42:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=748, Unknown=1, NotChecked=0, Total=870 [2023-11-12 00:42:09,059 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:42:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:09,701 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2023-11-12 00:42:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:42:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-12 00:42:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:09,703 INFO L225 Difference]: With dead ends: 117 [2023-11-12 00:42:09,703 INFO L226 Difference]: Without dead ends: 117 [2023-11-12 00:42:09,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=133, Invalid=796, Unknown=1, NotChecked=0, Total=930 [2023-11-12 00:42:09,705 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 4 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:09,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 806 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:42:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-12 00:42:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-12 00:42:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 112 states have internal predecessors, (123), 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:42:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2023-11-12 00:42:09,711 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 19 [2023-11-12 00:42:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:09,711 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2023-11-12 00:42:09,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:42:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2023-11-12 00:42:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:42:09,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:09,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:09,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:42:09,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:42:09,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:09,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 689394168, now seen corresponding path program 1 times [2023-11-12 00:42:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186719119] [2023-11-12 00:42:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:10,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186719119] [2023-11-12 00:42:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186719119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524475059] [2023-11-12 00:42:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:10,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:10,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:42:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:10,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:42:10,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:10,510 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:42:10,515 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:42:10,661 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:42:10,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:10,694 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:42:10,706 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:42:10,707 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:42:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-12 00:42:10,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524475059] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588732953] [2023-11-12 00:42:10,880 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:42:10,881 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:10,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:10,881 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:10,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:11,867 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-12 00:42:11,976 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:13,976 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1811#(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:42:13,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:13,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:42:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-12 00:42:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763928469] [2023-11-12 00:42:13,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:13,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:42:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:42:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=721, Unknown=1, NotChecked=54, Total=870 [2023-11-12 00:42:13,980 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 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:42:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:14,652 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2023-11-12 00:42:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:42:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 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:42:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:14,655 INFO L225 Difference]: With dead ends: 117 [2023-11-12 00:42:14,656 INFO L226 Difference]: Without dead ends: 117 [2023-11-12 00:42:14,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=125, Invalid=934, Unknown=1, NotChecked=62, Total=1122 [2023-11-12 00:42:14,657 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:14,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 671 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 699 Invalid, 0 Unknown, 126 Unchecked, 0.5s Time] [2023-11-12 00:42:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-12 00:42:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2023-11-12 00:42:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.103448275862069) internal successors, (122), 111 states have internal predecessors, (122), 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:42:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-11-12 00:42:14,667 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 19 [2023-11-12 00:42:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:14,682 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-11-12 00:42:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 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:42:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-11-12 00:42:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:42:14,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:14,684 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:42:14,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:42:14,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:14,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash -227971471, now seen corresponding path program 1 times [2023-11-12 00:42:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:14,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567982784] [2023-11-12 00:42:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:15,547 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:42:15,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567982784] [2023-11-12 00:42:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567982784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329934365] [2023-11-12 00:42:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:15,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:15,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:42:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:15,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:42:15,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:15,722 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:42:15,763 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:42:15,763 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:42:15,823 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:42:15,846 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-12 00:42:15,846 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 16 treesize of output 22 [2023-11-12 00:42:15,966 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:42:15,966 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:42:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-12 00:42:15,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:42:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329934365] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:42:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1261647658] [2023-11-12 00:42:16,605 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:42:16,605 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:16,605 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:16,606 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:16,606 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:17,932 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:42:17,955 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:20,892 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2243#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_114|) (= |#memory_int| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (exists ((|v_#length_140| (Array Int Int))) (= |#length| (store |v_#length_140| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_#valid_169| (Array Int Int))) (and (= (select |v_#valid_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 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|) (<= 4 (select |v_old(#length)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_50| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_BEFORE_CALL_50|) (= (select |v_old(#valid)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_54| (Array Int Int)) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 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 (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (<= 4 (select |v_#length_BEFORE_CALL_54| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= |v_old(#memory_int)_AFTER_CALL_31| (store |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))))) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_114|) (= |#memory_int| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (exists ((|v_#length_140| (Array Int Int))) (= |#length| (store |v_#length_140| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (exists ((|v_#valid_169| (Array Int Int))) (and (= (select |v_#valid_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_169| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_142| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:42:20,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:20,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:42:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-11-12 00:42:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004507542] [2023-11-12 00:42:20,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:20,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:42:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:42:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=4, NotChecked=70, Total=1406 [2023-11-12 00:42:20,896 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-12 00:42:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:21,569 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-11-12 00:42:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:42:21,571 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-11-12 00:42:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:21,572 INFO L225 Difference]: With dead ends: 124 [2023-11-12 00:42:21,572 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 00:42:21,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=178, Invalid=1380, Unknown=6, NotChecked=76, Total=1640 [2023-11-12 00:42:21,574 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 238 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:21,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 389 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 567 Invalid, 0 Unknown, 132 Unchecked, 0.5s Time] [2023-11-12 00:42:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 00:42:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2023-11-12 00:42:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 102 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:42:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-11-12 00:42:21,578 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 27 [2023-11-12 00:42:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:21,578 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-11-12 00:42:21,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-12 00:42:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-11-12 00:42:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:42:21,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:21,579 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:42:21,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:42:21,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:21,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash -227971470, now seen corresponding path program 1 times [2023-11-12 00:42:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200369191] [2023-11-12 00:42:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:22,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200369191] [2023-11-12 00:42:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200369191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285127403] [2023-11-12 00:42:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:22,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:22,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:42:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:22,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:42:22,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:22,728 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:42:22,737 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:42:22,747 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:42:22,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:22,778 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:42:22,804 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:42:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:22,834 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:42:22,897 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:42:22,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:22,933 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:42:22,942 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:42:22,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:42:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285127403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:42:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2023-11-12 00:42:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589962182] [2023-11-12 00:42:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:42:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:22,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:42:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2023-11-12 00:42:22,946 INFO L87 Difference]: Start difference. First operand 107 states and 119 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:42:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:23,227 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2023-11-12 00:42:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:42:23,227 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:42:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:23,228 INFO L225 Difference]: With dead ends: 102 [2023-11-12 00:42:23,228 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 00:42:23,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2023-11-12 00:42:23,230 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:23,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 275 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 135 Unchecked, 0.2s Time] [2023-11-12 00:42:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 00:42:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-12 00:42:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 97 states have internal predecessors, (108), 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:42:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-11-12 00:42:23,234 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 27 [2023-11-12 00:42:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-11-12 00:42:23,235 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:42:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-11-12 00:42:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:42:23,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:23,244 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:42:23,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:23,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:23,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:23,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -37031049, now seen corresponding path program 1 times [2023-11-12 00:42:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079760523] [2023-11-12 00:42:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:24,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079760523] [2023-11-12 00:42:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079760523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328046983] [2023-11-12 00:42:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:24,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:24,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:24,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:42:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:24,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-12 00:42:24,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:24,342 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:42:24,497 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:42:24,608 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:42:24,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:24,620 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 18 treesize of output 13 [2023-11-12 00:42:24,642 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-12 00:42:24,642 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:42:24,684 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:42:24,688 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:42:24,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328046983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [4950968] [2023-11-12 00:42:24,804 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:42:24,804 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:24,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:24,804 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:24,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:26,069 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:42:26,090 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:30,071 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2919#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_49| (store |v_#memory_int_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= 1 (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_158| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_158| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= |v_#memory_int_126| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.base_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_158| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_158| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_180| (Array Int Int))) (and (= (select |v_#valid_180| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_180| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= |v_#memory_int_126| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_126| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0)))))) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_48| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0))) |v_#memory_int_BEFORE_CALL_78|) (<= 4 (select |v_old(#length)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_158| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_158| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1))) (exists ((|v_#memory_$Pointer$.base_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_158| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_158| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#valid_180| (Array Int Int))) (and (= (select |v_#valid_180| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_180| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))))' at error location [2023-11-12 00:42:30,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:30,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:42:30,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-12 00:42:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230854029] [2023-11-12 00:42:30,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:42:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:42:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1509, Unknown=7, NotChecked=78, Total=1722 [2023-11-12 00:42:30,075 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:42:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:31,234 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2023-11-12 00:42:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:42:31,234 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-11-12 00:42:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:31,235 INFO L225 Difference]: With dead ends: 132 [2023-11-12 00:42:31,236 INFO L226 Difference]: Without dead ends: 132 [2023-11-12 00:42:31,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=193, Invalid=2154, Unknown=9, NotChecked=94, Total=2450 [2023-11-12 00:42:31,238 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 260 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:31,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 623 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 961 Invalid, 0 Unknown, 147 Unchecked, 0.8s Time] [2023-11-12 00:42:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-12 00:42:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2023-11-12 00:42:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 99 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:42:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-12 00:42:31,242 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 29 [2023-11-12 00:42:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:31,245 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-12 00:42:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:42:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-12 00:42:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 00:42:31,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:31,250 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:42:31,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:31,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:31,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:31,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -37031048, now seen corresponding path program 1 times [2023-11-12 00:42:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708187704] [2023-11-12 00:42:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:32,556 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:42:32,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708187704] [2023-11-12 00:42:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708187704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015100502] [2023-11-12 00:42:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:32,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:32,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:42:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:32,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-12 00:42:32,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:32,998 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:42:33,003 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:42:33,085 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:42:33,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:33,102 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:42:33,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:33,110 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:42:33,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:33,117 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:42:33,132 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:42:33,133 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:42:33,179 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:42:33,182 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:42:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-12 00:42:33,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015100502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142434839] [2023-11-12 00:42:33,479 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:42:33,480 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:33,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:33,480 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:33,480 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:34,606 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-12 00:42:34,632 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:38,983 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3315#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (or (< (select |#length| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 4)) (< |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_174| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_174| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 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_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#valid_189| (Array Int Int))) (and (= (select |v_#valid_189| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_189| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_161| (Array Int Int))) (= (store |v_#length_161| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_138|) (= |#memory_int| (store |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_174| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_174| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_170| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_174| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_174| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_178| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 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|) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_141| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#valid_189| (Array Int Int))) (and (= (select |v_#valid_189| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_189| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#length_161| (Array Int Int))) (= (store |v_#length_161| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_137| (Array Int (Array Int Int))) (|v_#memory_int_138| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_137| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_138|) (= |#memory_int| (store |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_138| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (<= 8 (select |#length| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_174| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_174| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_170| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:42:38,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:38,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:42:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2023-11-12 00:42:38,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367182417] [2023-11-12 00:42:38,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:38,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 00:42:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 00:42:38,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1749, Unknown=7, NotChecked=84, Total=1980 [2023-11-12 00:42:38,986 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 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:42:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:40,559 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2023-11-12 00:42:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:42:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 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 29 [2023-11-12 00:42:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:40,561 INFO L225 Difference]: With dead ends: 127 [2023-11-12 00:42:40,561 INFO L226 Difference]: Without dead ends: 127 [2023-11-12 00:42:40,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=218, Invalid=2641, Unknown=7, NotChecked=104, Total=2970 [2023-11-12 00:42:40,563 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 363 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:40,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 657 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 990 Invalid, 0 Unknown, 142 Unchecked, 0.9s Time] [2023-11-12 00:42:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-12 00:42:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2023-11-12 00:42:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.85) internal successors, (111), 99 states have internal predecessors, (111), 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:42:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2023-11-12 00:42:40,568 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 29 [2023-11-12 00:42:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:40,569 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2023-11-12 00:42:40,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 22 states have internal predecessors, (36), 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:42:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2023-11-12 00:42:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:42:40,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:40,570 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:42:40,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:40,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:40,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:40,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1147745991, now seen corresponding path program 1 times [2023-11-12 00:42:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890883546] [2023-11-12 00:42:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:40,850 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:42:40,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890883546] [2023-11-12 00:42:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890883546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:40,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:40,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230622238] [2023-11-12 00:42:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:40,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:40,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:40,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:40,855 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:40,905 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2023-11-12 00:42:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-12 00:42:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:40,906 INFO L225 Difference]: With dead ends: 106 [2023-11-12 00:42:40,907 INFO L226 Difference]: Without dead ends: 106 [2023-11-12 00:42:40,907 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:42:40,908 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:40,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 169 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-12 00:42:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2023-11-12 00:42:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 100 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:42:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2023-11-12 00:42:40,914 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 30 [2023-11-12 00:42:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:40,916 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2023-11-12 00:42:40,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2023-11-12 00:42:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 00:42:40,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:40,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:40,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:42:40,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:40,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1226893650, now seen corresponding path program 1 times [2023-11-12 00:42:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257278330] [2023-11-12 00:42:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:42:41,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257278330] [2023-11-12 00:42:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257278330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:41,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19838810] [2023-11-12 00:42:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:41,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:42:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:42:41,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:42:41,076 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:42:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:41,138 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2023-11-12 00:42:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:42:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 31 [2023-11-12 00:42:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:41,140 INFO L225 Difference]: With dead ends: 102 [2023-11-12 00:42:41,140 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 00:42:41,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:42:41,141 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:41,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 00:42:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-12 00:42:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.8) internal successors, (108), 97 states have internal predecessors, (108), 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:42:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-11-12 00:42:41,146 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 31 [2023-11-12 00:42:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:41,146 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-11-12 00:42:41,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:42:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-11-12 00:42:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:42:41,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:41,147 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:42:41,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:42:41,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:41,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash 621219042, now seen corresponding path program 1 times [2023-11-12 00:42:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:41,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145154249] [2023-11-12 00:42:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:42:41,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145154249] [2023-11-12 00:42:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145154249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048595821] [2023-11-12 00:42:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:41,223 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:41,358 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2023-11-12 00:42:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-12 00:42:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:41,360 INFO L225 Difference]: With dead ends: 116 [2023-11-12 00:42:41,360 INFO L226 Difference]: Without dead ends: 116 [2023-11-12 00:42:41,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:41,361 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:41,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 204 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-12 00:42:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-11-12 00:42:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 96 states have internal predecessors, (107), 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:42:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-11-12 00:42:41,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 32 [2023-11-12 00:42:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:41,365 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-11-12 00:42:41,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-11-12 00:42:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:42:41,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:41,366 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:42:41,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:42:41,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:41,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 621219043, now seen corresponding path program 1 times [2023-11-12 00:42:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764389898] [2023-11-12 00:42:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:42:41,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764389898] [2023-11-12 00:42:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764389898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828694938] [2023-11-12 00:42:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:41,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:41,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:41,512 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:41,659 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2023-11-12 00:42:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-12 00:42:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:41,660 INFO L225 Difference]: With dead ends: 115 [2023-11-12 00:42:41,660 INFO L226 Difference]: Without dead ends: 115 [2023-11-12 00:42:41,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:41,661 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:41,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 208 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-12 00:42:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2023-11-12 00:42:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 95 states have internal predecessors, (106), 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:42:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2023-11-12 00:42:41,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 32 [2023-11-12 00:42:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:41,665 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2023-11-12 00:42:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:42:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2023-11-12 00:42:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:42:41,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:41,666 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:42:41,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:42:41,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:41,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 822945434, now seen corresponding path program 1 times [2023-11-12 00:42:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055610976] [2023-11-12 00:42:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:41,781 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:42:41,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:41,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055610976] [2023-11-12 00:42:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055610976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694585885] [2023-11-12 00:42:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:41,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:42:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:42:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:42:41,783 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:42:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:41,967 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2023-11-12 00:42:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:42:41,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 32 [2023-11-12 00:42:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:41,968 INFO L225 Difference]: With dead ends: 97 [2023-11-12 00:42:41,968 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 00:42:41,969 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:42:41,969 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:41,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 270 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:42:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 00:42:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-12 00:42:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 92 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:42:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-11-12 00:42:41,975 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 32 [2023-11-12 00:42:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:41,976 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-11-12 00:42:41,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:42:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-11-12 00:42:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:42:41,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:41,977 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:42:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 00:42:41,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:41,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 822945435, now seen corresponding path program 1 times [2023-11-12 00:42:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419879775] [2023-11-12 00:42:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:42,105 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:42:42,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419879775] [2023-11-12 00:42:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419879775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:42:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602927652] [2023-11-12 00:42:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:42,108 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:42:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:42,161 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-11-12 00:42:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:42:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:42,162 INFO L225 Difference]: With dead ends: 96 [2023-11-12 00:42:42,162 INFO L226 Difference]: Without dead ends: 96 [2023-11-12 00:42:42,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:42:42,163 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:42,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 173 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-12 00:42:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-12 00:42:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 91 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:42:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-11-12 00:42:42,169 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 32 [2023-11-12 00:42:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:42,169 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-11-12 00:42:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:42:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-11-12 00:42:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:42:42,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:42,171 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] [2023-11-12 00:42:42,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 00:42:42,172 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:42,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2077921146, now seen corresponding path program 1 times [2023-11-12 00:42:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504795636] [2023-11-12 00:42:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:42:42,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:42,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504795636] [2023-11-12 00:42:42,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504795636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:42,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:42,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206012049] [2023-11-12 00:42:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:42:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:42,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:42:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:42:42,394 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:42:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:42,592 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2023-11-12 00:42:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:42:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 33 [2023-11-12 00:42:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:42,593 INFO L225 Difference]: With dead ends: 93 [2023-11-12 00:42:42,593 INFO L226 Difference]: Without dead ends: 93 [2023-11-12 00:42:42,593 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:42:42,594 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:42,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 278 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:42:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-12 00:42:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-12 00:42:42,597 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:42:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2023-11-12 00:42:42,598 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 33 [2023-11-12 00:42:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:42,598 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2023-11-12 00:42:42,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:42:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2023-11-12 00:42:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:42:42,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:42,599 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, 1] [2023-11-12 00:42:42,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 00:42:42,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:42,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -277570309, now seen corresponding path program 1 times [2023-11-12 00:42:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431104184] [2023-11-12 00:42:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-12 00:42:42,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431104184] [2023-11-12 00:42:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431104184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:42,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:42,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029814773] [2023-11-12 00:42:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:42,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:42:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:42:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:42:42,808 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 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:42:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:42,937 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2023-11-12 00:42:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:42:42,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 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 35 [2023-11-12 00:42:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:42,939 INFO L225 Difference]: With dead ends: 89 [2023-11-12 00:42:42,939 INFO L226 Difference]: Without dead ends: 89 [2023-11-12 00:42:42,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:42:42,940 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 169 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:42,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 115 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-12 00:42:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-12 00:42:42,943 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:42:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-11-12 00:42:42,943 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 35 [2023-11-12 00:42:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:42,945 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-11-12 00:42:42,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 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:42:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-11-12 00:42:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 00:42:42,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:42,947 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, 1, 1] [2023-11-12 00:42:42,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 00:42:42,947 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-12 00:42:42,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash -14739647, now seen corresponding path program 1 times [2023-11-12 00:42:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623519409] [2023-11-12 00:42:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:43,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623519409] [2023-11-12 00:42:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623519409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984376358] [2023-11-12 00:42:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:43,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:43,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac141230-f5da-4be0-bde8-147468dc87d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:42:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:43,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-12 00:42:43,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:43,993 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:42:44,190 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:42:44,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:42:44,405 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 18 treesize of output 13 [2023-11-12 00:42:44,424 INFO L322 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-12 00:42:44,424 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 21 treesize of output 29 [2023-11-12 00:42:44,792 INFO L322 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2023-11-12 00:42:44,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 62 [2023-11-12 00:42:45,438 INFO L190 IndexEqualityManager]: detected not equals via solver