./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:30:00,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:30:00,952 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:30:00,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:30:00,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:30:00,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:30:00,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:30:00,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:30:00,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:30:00,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:30:00,986 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:30:00,987 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:30:00,988 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:30:00,988 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:30:00,989 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:30:00,989 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:30:00,990 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:30:00,990 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:30:00,991 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:30:00,992 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:30:00,992 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:30:00,998 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:30:00,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:30:00,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:30:01,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:30:01,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:30:01,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:30:01,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:30:01,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:30:01,003 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:30:01,004 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:30:01,004 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:30:01,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:30:01,005 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:30:01,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:30:01,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:30:01,006 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:30:01,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:30:01,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:30:01,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:30:01,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:30:01,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:30:01,007 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:30:01,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:30:01,009 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:30:01,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:30:01,009 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_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/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_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-11-06 20:30:01,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:30:01,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:30:01,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:30:01,311 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:30:01,312 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:30:01,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-06 20:30:04,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:30:04,826 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:30:04,828 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-11-06 20:30:04,843 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/data/444554f1f/e5b25e32d78f44f18a34296b49af4965/FLAG662beb8e1 [2023-11-06 20:30:04,857 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/data/444554f1f/e5b25e32d78f44f18a34296b49af4965 [2023-11-06 20:30:04,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:30:04,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:30:04,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:30:04,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:30:04,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:30:04,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:30:04" (1/1) ... [2023-11-06 20:30:04,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68964096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:04, skipping insertion in model container [2023-11-06 20:30:04,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:30:04" (1/1) ... [2023-11-06 20:30:04,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:30:05,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:30:05,274 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:30:05,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:30:05,402 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:30:05,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05 WrapperNode [2023-11-06 20:30:05,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:30:05,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:30:05,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:30:05,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:30:05,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,490 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2023-11-06 20:30:05,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:30:05,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:30:05,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:30:05,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:30:05,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:30:05,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:30:05,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:30:05,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:30:05,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (1/1) ... [2023-11-06 20:30:05,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:30:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:05,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:30:05,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:30:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:30:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:30:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:30:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:30:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:30:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:30:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:30:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:30:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:30:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:30:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:30:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:30:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:30:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:30:05,795 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:30:05,798 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:30:06,128 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:30:06,202 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:30:06,202 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 20:30:06,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:30:06 BoogieIcfgContainer [2023-11-06 20:30:06,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:30:06,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:30:06,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:30:06,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:30:06,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:30:04" (1/3) ... [2023-11-06 20:30:06,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ad29b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:30:06, skipping insertion in model container [2023-11-06 20:30:06,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:05" (2/3) ... [2023-11-06 20:30:06,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ad29b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:30:06, skipping insertion in model container [2023-11-06 20:30:06,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:30:06" (3/3) ... [2023-11-06 20:30:06,215 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-11-06 20:30:06,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:30:06,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-11-06 20:30:06,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:30:06,324 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;@4293bd3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:30:06,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-06 20:30:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 34 states have (on average 2.176470588235294) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:30:06,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:06,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:30:06,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:06,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1543760061, now seen corresponding path program 1 times [2023-11-06 20:30:06,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427809310] [2023-11-06 20:30:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:06,731 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-06 20:30:06,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:06,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427809310] [2023-11-06 20:30:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427809310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:30:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641828086] [2023-11-06 20:30:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:06,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:30:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:06,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:30:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:30:06,774 INFO L87 Difference]: Start difference. First operand has 69 states, 34 states have (on average 2.176470588235294) internal successors, (74), 65 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-06 20:30:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:06,845 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2023-11-06 20:30:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:30:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-11-06 20:30:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:06,856 INFO L225 Difference]: With dead ends: 74 [2023-11-06 20:30:06,856 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 20:30:06,858 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-06 20:30:06,862 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:06,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 118 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:30:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 20:30:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2023-11-06 20:30:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 33 states have (on average 2.090909090909091) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-11-06 20:30:06,908 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 6 [2023-11-06 20:30:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:06,908 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-11-06 20:30:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-06 20:30:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-11-06 20:30:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:30:06,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:06,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:30:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:30:06,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:06,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1387625430, now seen corresponding path program 1 times [2023-11-06 20:30:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790096745] [2023-11-06 20:30:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:06,984 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-06 20:30:06,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790096745] [2023-11-06 20:30:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790096745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:30:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921130876] [2023-11-06 20:30:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:06,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:30:06,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:06,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:30:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:30:06,990 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 20:30:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:07,116 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-11-06 20:30:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:30:07,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-06 20:30:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:07,118 INFO L225 Difference]: With dead ends: 65 [2023-11-06 20:30:07,118 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 20:30:07,119 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-06 20:30:07,121 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:07,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:30:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 20:30:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-06 20:30:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-06 20:30:07,130 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 6 [2023-11-06 20:30:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:07,130 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-06 20:30:07,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 20:30:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-06 20:30:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:30:07,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:07,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:30:07,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:30:07,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:07,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1387625431, now seen corresponding path program 1 times [2023-11-06 20:30:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:07,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705950408] [2023-11-06 20:30:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:07,313 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-06 20:30:07,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705950408] [2023-11-06 20:30:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705950408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:07,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:30:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825458669] [2023-11-06 20:30:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:07,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:30:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:07,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:30:07,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:30:07,320 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 20:30:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:07,406 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-06 20:30:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:30:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-06 20:30:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:07,408 INFO L225 Difference]: With dead ends: 63 [2023-11-06 20:30:07,409 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 20:30:07,409 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-06 20:30:07,414 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:07,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:30:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 20:30:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 20:30:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-06 20:30:07,431 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 6 [2023-11-06 20:30:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:07,432 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-06 20:30:07,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-06 20:30:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-06 20:30:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:30:07,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:07,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:07,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:30:07,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:07,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1048216494, now seen corresponding path program 1 times [2023-11-06 20:30:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224479074] [2023-11-06 20:30:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:07,602 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-06 20:30:07,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224479074] [2023-11-06 20:30:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224479074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:30:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949743222] [2023-11-06 20:30:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:30:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:30:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:30:07,606 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 20:30:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:07,823 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-11-06 20:30:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:30:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 20:30:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:07,829 INFO L225 Difference]: With dead ends: 63 [2023-11-06 20:30:07,829 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 20:30:07,830 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-06 20:30:07,837 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:07,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 175 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:30:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 20:30:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-11-06 20:30:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-06 20:30:07,853 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 10 [2023-11-06 20:30:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:07,853 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-06 20:30:07,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 20:30:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-06 20:30:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:30:07,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:07,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:07,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:30:07,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:07,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1048216493, now seen corresponding path program 1 times [2023-11-06 20:30:07,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:07,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041375035] [2023-11-06 20:30:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:08,101 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-06 20:30:08,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041375035] [2023-11-06 20:30:08,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041375035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:08,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:30:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060343011] [2023-11-06 20:30:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:08,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:30:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:30:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:30:08,105 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:30:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:08,266 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2023-11-06 20:30:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:30:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:30:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:08,268 INFO L225 Difference]: With dead ends: 62 [2023-11-06 20:30:08,268 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 20:30:08,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:30:08,269 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:08,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 238 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:30:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 20:30:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-06 20:30:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-06 20:30:08,276 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 10 [2023-11-06 20:30:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:08,276 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-06 20:30:08,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:30:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-06 20:30:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:30:08,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:08,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:08,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:30:08,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:08,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1816262037, now seen corresponding path program 1 times [2023-11-06 20:30:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984166859] [2023-11-06 20:30:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:30:08,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984166859] [2023-11-06 20:30:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984166859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615455647] [2023-11-06 20:30:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:08,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:30:08,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:30:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:08,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:30:08,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:30:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:30:08,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:30:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:30:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615455647] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:30:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [895909933] [2023-11-06 20:30:08,625 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:30:08,625 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:30:08,630 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:30:08,635 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:30:08,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:30:11,093 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-06 20:30:11,800 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:30:18,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '856#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~data#1| 1) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~data#1| 1) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (or (and (exists ((|v_#memory_int_56| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_56| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_53|) (= |#memory_int| (store |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (exists ((|v_#valid_86| (Array Int Int))) (and (= (store |v_#valid_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_#length_71| (Array Int Int))) (= (store |v_#length_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|))) (and (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_56| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_56| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_53|) (= |#memory_int| (store |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_53| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1))))) (exists ((|v_#valid_86| (Array Int Int))) (and (= (store |v_#valid_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_#length_71| (Array Int Int))) (= (store |v_#length_71| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)))' at error location [2023-11-06 20:30:18,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:30:18,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:30:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 20:30:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071490636] [2023-11-06 20:30:18,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:30:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:30:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:30:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=231, Unknown=4, NotChecked=0, Total=272 [2023-11-06 20:30:18,150 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 20:30:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:18,195 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2023-11-06 20:30:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:30:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-06 20:30:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:18,197 INFO L225 Difference]: With dead ends: 65 [2023-11-06 20:30:18,197 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 20:30:18,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=37, Invalid=231, Unknown=4, NotChecked=0, Total=272 [2023-11-06 20:30:18,198 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:18,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:30:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 20:30:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-06 20:30:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 60 states have internal predecessors, (66), 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-06 20:30:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-11-06 20:30:18,205 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 19 [2023-11-06 20:30:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:18,206 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-11-06 20:30:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 20:30:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-11-06 20:30:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:30:18,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:18,208 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:18,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:30:18,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 20:30:18,414 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:18,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash -987040709, now seen corresponding path program 2 times [2023-11-06 20:30:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:18,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75156974] [2023-11-06 20:30:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:30:19,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75156974] [2023-11-06 20:30:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75156974] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718665074] [2023-11-06 20:30:19,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:30:19,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:19,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:19,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:30:19,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:30:19,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 20:30:19,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:30:19,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 20:30:19,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:30:19,285 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-06 20:30:19,312 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-06 20:30:19,377 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 20:30:19,378 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-06 20:30:19,450 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-06 20:30:19,463 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 20:30:19,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:19,490 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-06 20:30:19,526 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-06 20:30:19,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:19,558 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-06 20:30:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2023-11-06 20:30:19,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:30:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718665074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2057276174] [2023-11-06 20:30:19,636 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:30:19,636 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:30:19,636 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:30:19,636 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:30:19,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:30:21,136 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-06 20:30:21,694 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:30:28,446 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1105#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~data#1| 1) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (or (and (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_65| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1)) |#memory_int|) (= (store |v_#memory_int_64| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_64| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_65|))) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_78| (Array Int Int))) (= |#length| (store |v_#length_78| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_68| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_old(#length)_AFTER_CALL_20| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#valid_99| (Array Int Int))) (and (= (store |v_#valid_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_87| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_87| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))))) (and (exists ((|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_87| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_87| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_64| (Array Int (Array Int Int))) (|v_#memory_int_65| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 1)) |#memory_int|) (= (store |v_#memory_int_64| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_64| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_65| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_65|))) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_78| (Array Int Int))) (= |#length| (store |v_#length_78| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#valid_99| (Array Int Int))) (and (= (store |v_#valid_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_68| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_#length_BEFORE_CALL_35| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|))))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~data#1| 1) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)))' at error location [2023-11-06 20:30:28,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:30:28,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 20:30:28,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-11-06 20:30:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512999934] [2023-11-06 20:30:28,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 20:30:28,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 20:30:28,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 20:30:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=663, Unknown=5, NotChecked=52, Total=812 [2023-11-06 20:30:28,449 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 20:30:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:28,874 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-11-06 20:30:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:30:28,874 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-06 20:30:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:28,875 INFO L225 Difference]: With dead ends: 71 [2023-11-06 20:30:28,875 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 20:30:28,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=121, Invalid=806, Unknown=7, NotChecked=58, Total=992 [2023-11-06 20:30:28,877 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:28,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 148 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2023-11-06 20:30:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 20:30:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2023-11-06 20:30:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 56 states have internal predecessors, (62), 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-06 20:30:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-11-06 20:30:28,885 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 28 [2023-11-06 20:30:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:28,886 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-11-06 20:30:28,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 20:30:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-11-06 20:30:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:30:28,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:28,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:28,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:30:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:29,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:29,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash -987040708, now seen corresponding path program 1 times [2023-11-06 20:30:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760660691] [2023-11-06 20:30:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:30:30,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760660691] [2023-11-06 20:30:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760660691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841556028] [2023-11-06 20:30:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:30,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:30,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:30:30,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:30:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:30,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 20:30:30,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:30:30,188 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-06 20:30:30,207 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-06 20:30:30,216 WARN L861 $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-06 20:30:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:30,243 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-06 20:30:30,275 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-06 20:30:30,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:30,308 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-06 20:30:30,337 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-06 20:30:30,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:30,369 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-06 20:30:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:30:30,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:30:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841556028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:30:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 13 [2023-11-06 20:30:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241397508] [2023-11-06 20:30:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:30,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:30:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:30:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2023-11-06 20:30:30,379 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:30,501 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-11-06 20:30:30,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:30:30,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 20:30:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:30,502 INFO L225 Difference]: With dead ends: 59 [2023-11-06 20:30:30,502 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 20:30:30,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2023-11-06 20:30:30,503 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:30,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2023-11-06 20:30:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 20:30:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-06 20:30:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 54 states have internal predecessors, (60), 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-06 20:30:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-11-06 20:30:30,508 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2023-11-06 20:30:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:30,509 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-11-06 20:30:30,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-11-06 20:30:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 20:30:30,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:30,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:30,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:30:30,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:30,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:30,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 641782052, now seen corresponding path program 1 times [2023-11-06 20:30:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478154239] [2023-11-06 20:30:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:30:31,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478154239] [2023-11-06 20:30:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478154239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300604162] [2023-11-06 20:30:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:31,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:30:31,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:30:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:31,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 20:30:31,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:30:31,744 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-06 20:30:31,868 WARN L861 $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-06 20:30:31,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:30:31,883 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-06 20:30:31,905 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 20:30:31,906 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-06 20:30:31,944 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-06 20:30:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 20:30:31,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:30:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300604162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:30:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-11-06 20:30:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548594810] [2023-11-06 20:30:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:31,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 20:30:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 20:30:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2023-11-06 20:30:31,953 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:32,304 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-11-06 20:30:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 20:30:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-11-06 20:30:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:32,306 INFO L225 Difference]: With dead ends: 70 [2023-11-06 20:30:32,306 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 20:30:32,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=473, Unknown=1, NotChecked=44, Total=600 [2023-11-06 20:30:32,307 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 90 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:32,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 164 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2023-11-06 20:30:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 20:30:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2023-11-06 20:30:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 56 states have internal predecessors, (64), 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-06 20:30:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-11-06 20:30:32,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 30 [2023-11-06 20:30:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:32,312 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-11-06 20:30:32,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:30:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-11-06 20:30:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 20:30:32,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:32,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:32,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 20:30:32,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:32,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:30:32,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 641782053, now seen corresponding path program 1 times [2023-11-06 20:30:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771091222] [2023-11-06 20:30:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:32,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:30:34,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771091222] [2023-11-06 20:30:34,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771091222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:30:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081401370] [2023-11-06 20:30:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:34,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:30:34,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:34,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:30:34,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa96241a-fa16-4639-8ebe-06b58bef79ee/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process