./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:11:47,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:11:47,361 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 21:11:47,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:11:47,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:11:47,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:11:47,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:11:47,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:11:47,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:11:47,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:11:47,400 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:11:47,400 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:11:47,401 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:11:47,401 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:11:47,402 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:11:47,403 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:11:47,403 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:11:47,404 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:11:47,405 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:11:47,405 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:11:47,406 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:11:47,407 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:11:47,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:11:47,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:11:47,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:11:47,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:11:47,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:11:47,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:11:47,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:11:47,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:11:47,415 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:11:47,415 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:11:47,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:11:47,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:11:47,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:11:47,417 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:11:47,418 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:11:47,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:11:47,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:11:47,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:11:47,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:11:47,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:11:47,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:11:47,430 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:11:47,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:11:47,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:11:47,431 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:11:47,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:11:47,432 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_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/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_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-11-23 21:11:47,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:11:47,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:11:47,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:11:47,726 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:11:47,727 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:11:47,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-23 21:11:50,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:11:51,314 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:11:51,314 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-23 21:11:51,338 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/data/ec6d5deed/c7bb695b29d247f398abff03b64eec64/FLAGaa983ff8d [2023-11-23 21:11:51,368 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/data/ec6d5deed/c7bb695b29d247f398abff03b64eec64 [2023-11-23 21:11:51,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:11:51,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:11:51,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:11:51,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:11:51,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:11:51,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:51" (1/1) ... [2023-11-23 21:11:51,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35754409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:51, skipping insertion in model container [2023-11-23 21:11:51,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:11:51" (1/1) ... [2023-11-23 21:11:51,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:11:52,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:11:52,092 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:11:52,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:11:52,246 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:11:52,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52 WrapperNode [2023-11-23 21:11:52,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:11:52,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:11:52,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:11:52,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:11:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,327 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-23 21:11:52,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:11:52,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:11:52,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:11:52,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:11:52,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:11:52,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:11:52,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:11:52,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:11:52,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (1/1) ... [2023-11-23 21:11:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:11:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:11:52,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:11:52,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:11:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-23 21:11:52,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-23 21:11:52,568 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-23 21:11:52,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-23 21:11:52,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:11:52,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:11:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-23 21:11:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:11:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:11:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-23 21:11:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:11:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:11:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:11:52,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:11:52,576 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:11:52,816 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:11:52,818 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:11:53,451 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:11:53,729 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:11:53,730 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 21:11:53,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:53 BoogieIcfgContainer [2023-11-23 21:11:53,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:11:53,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:11:53,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:11:53,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:11:53,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:11:51" (1/3) ... [2023-11-23 21:11:53,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d71674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:53, skipping insertion in model container [2023-11-23 21:11:53,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:11:52" (2/3) ... [2023-11-23 21:11:53,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d71674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:11:53, skipping insertion in model container [2023-11-23 21:11:53,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:11:53" (3/3) ... [2023-11-23 21:11:53,745 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-11-23 21:11:53,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:11:53,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-23 21:11:53,767 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:11:53,902 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-23 21:11:53,951 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 142 transitions, 298 flow [2023-11-23 21:11:54,468 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9714 states, 8247 states have (on average 3.426821874621074) internal successors, (28261), 9713 states have internal predecessors, (28261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:54,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:11:54,501 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;@85db391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:11:54,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-23 21:11:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 9714 states, 8247 states have (on average 3.426821874621074) internal successors, (28261), 9713 states have internal predecessors, (28261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:11:54,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:11:54,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:11:54,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:11:54,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:11:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash 18931, now seen corresponding path program 1 times [2023-11-23 21:11:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:11:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578672851] [2023-11-23 21:11:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:11:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:11:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:11:55,023 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-23 21:11:55,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:11:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578672851] [2023-11-23 21:11:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578672851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:11:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:11:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:11:55,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55303315] [2023-11-23 21:11:55,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:11:55,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:11:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:11:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:11:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:11:55,089 INFO L87 Difference]: Start difference. First operand has 9714 states, 8247 states have (on average 3.426821874621074) internal successors, (28261), 9713 states have internal predecessors, (28261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:11:55,505 INFO L93 Difference]: Finished difference Result 9517 states and 27334 transitions. [2023-11-23 21:11:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:11:55,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:11:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:11:55,623 INFO L225 Difference]: With dead ends: 9517 [2023-11-23 21:11:55,624 INFO L226 Difference]: Without dead ends: 9517 [2023-11-23 21:11:55,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:11:55,629 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:11:55,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:11:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2023-11-23 21:11:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 9517. [2023-11-23 21:11:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9517 states, 8054 states have (on average 3.393841569406506) internal successors, (27334), 9516 states have internal predecessors, (27334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9517 states to 9517 states and 27334 transitions. [2023-11-23 21:11:56,332 INFO L78 Accepts]: Start accepts. Automaton has 9517 states and 27334 transitions. Word has length 2 [2023-11-23 21:11:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:11:56,332 INFO L495 AbstractCegarLoop]: Abstraction has 9517 states and 27334 transitions. [2023-11-23 21:11:56,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9517 states and 27334 transitions. [2023-11-23 21:11:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:11:56,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:11:56,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:11:56,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:11:56,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:11:56,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:11:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 18932, now seen corresponding path program 1 times [2023-11-23 21:11:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:11:56,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010396448] [2023-11-23 21:11:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:11:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:11:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:11:56,545 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-23 21:11:56,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:11:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010396448] [2023-11-23 21:11:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010396448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:11:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:11:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:11:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048631921] [2023-11-23 21:11:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:11:56,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:11:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:11:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:11:56,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:11:56,556 INFO L87 Difference]: Start difference. First operand 9517 states and 27334 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:11:56,945 INFO L93 Difference]: Finished difference Result 9514 states and 27331 transitions. [2023-11-23 21:11:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:11:56,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:11:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:11:57,047 INFO L225 Difference]: With dead ends: 9514 [2023-11-23 21:11:57,047 INFO L226 Difference]: Without dead ends: 9514 [2023-11-23 21:11:57,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:11:57,049 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:11:57,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:11:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9514 states. [2023-11-23 21:11:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9514 to 9514. [2023-11-23 21:11:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9514 states, 8054 states have (on average 3.3934690836851256) internal successors, (27331), 9513 states have internal predecessors, (27331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 27331 transitions. [2023-11-23 21:11:57,565 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 27331 transitions. Word has length 2 [2023-11-23 21:11:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:11:57,565 INFO L495 AbstractCegarLoop]: Abstraction has 9514 states and 27331 transitions. [2023-11-23 21:11:57,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 27331 transitions. [2023-11-23 21:11:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:11:57,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:11:57,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:11:57,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:11:57,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:11:57,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:11:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 564545760, now seen corresponding path program 1 times [2023-11-23 21:11:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:11:57,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793905985] [2023-11-23 21:11:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:11:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:11:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:11:57,708 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-23 21:11:57,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:11:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793905985] [2023-11-23 21:11:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793905985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:11:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:11:57,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:11:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710461304] [2023-11-23 21:11:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:11:57,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:11:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:11:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:11:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:11:57,712 INFO L87 Difference]: Start difference. First operand 9514 states and 27331 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:11:58,176 INFO L93 Difference]: Finished difference Result 9512 states and 27329 transitions. [2023-11-23 21:11:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:11:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:11:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:11:58,332 INFO L225 Difference]: With dead ends: 9512 [2023-11-23 21:11:58,333 INFO L226 Difference]: Without dead ends: 9512 [2023-11-23 21:11:58,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:11:58,334 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:11:58,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:11:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9512 states. [2023-11-23 21:11:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9512 to 9512. [2023-11-23 21:11:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9512 states, 8054 states have (on average 3.3932207598708715) internal successors, (27329), 9511 states have internal predecessors, (27329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 27329 transitions. [2023-11-23 21:11:58,902 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 27329 transitions. Word has length 5 [2023-11-23 21:11:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:11:58,902 INFO L495 AbstractCegarLoop]: Abstraction has 9512 states and 27329 transitions. [2023-11-23 21:11:58,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 27329 transitions. [2023-11-23 21:11:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:11:58,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:11:58,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:11:58,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:11:58,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:11:58,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:11:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 564545759, now seen corresponding path program 1 times [2023-11-23 21:11:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:11:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735893216] [2023-11-23 21:11:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:11:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:11:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:11:59,013 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-23 21:11:59,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:11:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735893216] [2023-11-23 21:11:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735893216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:11:59,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:11:59,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:11:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884455734] [2023-11-23 21:11:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:11:59,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:11:59,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:11:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:11:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:11:59,015 INFO L87 Difference]: Start difference. First operand 9512 states and 27329 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:11:59,318 INFO L93 Difference]: Finished difference Result 9510 states and 27327 transitions. [2023-11-23 21:11:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:11:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:11:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:11:59,369 INFO L225 Difference]: With dead ends: 9510 [2023-11-23 21:11:59,369 INFO L226 Difference]: Without dead ends: 9510 [2023-11-23 21:11:59,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:11:59,370 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:11:59,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:11:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9510 states. [2023-11-23 21:11:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9510 to 9510. [2023-11-23 21:11:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9510 states, 8054 states have (on average 3.392972436056618) internal successors, (27327), 9509 states have internal predecessors, (27327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9510 states to 9510 states and 27327 transitions. [2023-11-23 21:11:59,765 INFO L78 Accepts]: Start accepts. Automaton has 9510 states and 27327 transitions. Word has length 5 [2023-11-23 21:11:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:11:59,766 INFO L495 AbstractCegarLoop]: Abstraction has 9510 states and 27327 transitions. [2023-11-23 21:11:59,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:11:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9510 states and 27327 transitions. [2023-11-23 21:11:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:11:59,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:11:59,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:11:59,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:11:59,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:11:59,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:11:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -495210249, now seen corresponding path program 1 times [2023-11-23 21:11:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:11:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068511360] [2023-11-23 21:11:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:11:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:11:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:11:59,912 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-23 21:11:59,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:11:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068511360] [2023-11-23 21:11:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068511360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:11:59,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:11:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:11:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059197311] [2023-11-23 21:11:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:11:59,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:11:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:11:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:11:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:11:59,914 INFO L87 Difference]: Start difference. First operand 9510 states and 27327 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:00,231 INFO L93 Difference]: Finished difference Result 7696 states and 21678 transitions. [2023-11-23 21:12:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:00,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 21:12:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:00,276 INFO L225 Difference]: With dead ends: 7696 [2023-11-23 21:12:00,276 INFO L226 Difference]: Without dead ends: 7696 [2023-11-23 21:12:00,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:12:00,278 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:00,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 30 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7696 states. [2023-11-23 21:12:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7696 to 7696. [2023-11-23 21:12:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7696 states, 6697 states have (on average 3.2369717784082424) internal successors, (21678), 7695 states have internal predecessors, (21678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7696 states to 7696 states and 21678 transitions. [2023-11-23 21:12:00,578 INFO L78 Accepts]: Start accepts. Automaton has 7696 states and 21678 transitions. Word has length 9 [2023-11-23 21:12:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:00,578 INFO L495 AbstractCegarLoop]: Abstraction has 7696 states and 21678 transitions. [2023-11-23 21:12:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 21678 transitions. [2023-11-23 21:12:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 21:12:00,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:00,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:00,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:12:00,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:00,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -495210248, now seen corresponding path program 1 times [2023-11-23 21:12:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87254256] [2023-11-23 21:12:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:00,705 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-23 21:12:00,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87254256] [2023-11-23 21:12:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87254256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:00,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:00,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:12:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937624962] [2023-11-23 21:12:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:12:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:12:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:00,708 INFO L87 Difference]: Start difference. First operand 7696 states and 21678 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:00,977 INFO L93 Difference]: Finished difference Result 5882 states and 16029 transitions. [2023-11-23 21:12:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 21:12:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:01,008 INFO L225 Difference]: With dead ends: 5882 [2023-11-23 21:12:01,008 INFO L226 Difference]: Without dead ends: 5882 [2023-11-23 21:12:01,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:12:01,013 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 106 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:01,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 31 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:12:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5882 states. [2023-11-23 21:12:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5882 to 5882. [2023-11-23 21:12:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5882 states, 5340 states have (on average 3.001685393258427) internal successors, (16029), 5881 states have internal predecessors, (16029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 16029 transitions. [2023-11-23 21:12:01,185 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 16029 transitions. Word has length 9 [2023-11-23 21:12:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:01,185 INFO L495 AbstractCegarLoop]: Abstraction has 5882 states and 16029 transitions. [2023-11-23 21:12:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 16029 transitions. [2023-11-23 21:12:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 21:12:01,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:01,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:12:01,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:01,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 404867781, now seen corresponding path program 1 times [2023-11-23 21:12:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684730527] [2023-11-23 21:12:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:01,302 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-23 21:12:01,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684730527] [2023-11-23 21:12:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684730527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:01,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:12:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684313405] [2023-11-23 21:12:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:01,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:12:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:12:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:01,306 INFO L87 Difference]: Start difference. First operand 5882 states and 16029 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:01,466 INFO L93 Difference]: Finished difference Result 5796 states and 15852 transitions. [2023-11-23 21:12:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 21:12:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:01,500 INFO L225 Difference]: With dead ends: 5796 [2023-11-23 21:12:01,500 INFO L226 Difference]: Without dead ends: 5796 [2023-11-23 21:12:01,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:12:01,504 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:01,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 28 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2023-11-23 21:12:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 5796. [2023-11-23 21:12:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5796 states, 5297 states have (on average 2.992637341891637) internal successors, (15852), 5795 states have internal predecessors, (15852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 15852 transitions. [2023-11-23 21:12:01,792 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 15852 transitions. Word has length 12 [2023-11-23 21:12:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:01,793 INFO L495 AbstractCegarLoop]: Abstraction has 5796 states and 15852 transitions. [2023-11-23 21:12:01,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 15852 transitions. [2023-11-23 21:12:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-23 21:12:01,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:01,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:01,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:12:01,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:01,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:01,795 INFO L85 PathProgramCache]: Analyzing trace with hash 404867782, now seen corresponding path program 1 times [2023-11-23 21:12:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505914678] [2023-11-23 21:12:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:01,883 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-23 21:12:01,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505914678] [2023-11-23 21:12:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505914678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:01,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:12:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957623843] [2023-11-23 21:12:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:01,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:12:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:12:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:01,886 INFO L87 Difference]: Start difference. First operand 5796 states and 15852 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:02,033 INFO L93 Difference]: Finished difference Result 5710 states and 15675 transitions. [2023-11-23 21:12:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:02,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-23 21:12:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:02,062 INFO L225 Difference]: With dead ends: 5710 [2023-11-23 21:12:02,062 INFO L226 Difference]: Without dead ends: 5710 [2023-11-23 21:12:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 21:12:02,064 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 99 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:02,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 29 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2023-11-23 21:12:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 5710. [2023-11-23 21:12:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 5254 states have (on average 2.9834411876665397) internal successors, (15675), 5709 states have internal predecessors, (15675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 15675 transitions. [2023-11-23 21:12:02,237 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 15675 transitions. Word has length 12 [2023-11-23 21:12:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:02,237 INFO L495 AbstractCegarLoop]: Abstraction has 5710 states and 15675 transitions. [2023-11-23 21:12:02,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 15675 transitions. [2023-11-23 21:12:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:12:02,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:02,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:02,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:12:02,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:02,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -495378664, now seen corresponding path program 1 times [2023-11-23 21:12:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374050578] [2023-11-23 21:12:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:02,386 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-23 21:12:02,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374050578] [2023-11-23 21:12:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374050578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:12:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314718362] [2023-11-23 21:12:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:12:02,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:02,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:12:02,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:12:02,391 INFO L87 Difference]: Start difference. First operand 5710 states and 15675 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:02,871 INFO L93 Difference]: Finished difference Result 4510 states and 12419 transitions. [2023-11-23 21:12:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:12:02,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 21:12:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:02,896 INFO L225 Difference]: With dead ends: 4510 [2023-11-23 21:12:02,896 INFO L226 Difference]: Without dead ends: 4510 [2023-11-23 21:12:02,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:12:02,898 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 163 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:02,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 123 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:12:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2023-11-23 21:12:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2023-11-23 21:12:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4246 states have (on average 2.9248704663212437) internal successors, (12419), 4509 states have internal predecessors, (12419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 12419 transitions. [2023-11-23 21:12:03,042 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 12419 transitions. Word has length 16 [2023-11-23 21:12:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:03,043 INFO L495 AbstractCegarLoop]: Abstraction has 4510 states and 12419 transitions. [2023-11-23 21:12:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 12419 transitions. [2023-11-23 21:12:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:12:03,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:03,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:03,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:12:03,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:03,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -495378663, now seen corresponding path program 1 times [2023-11-23 21:12:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890014463] [2023-11-23 21:12:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:03,315 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-23 21:12:03,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890014463] [2023-11-23 21:12:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890014463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:12:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396341658] [2023-11-23 21:12:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:12:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:12:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:12:03,317 INFO L87 Difference]: Start difference. First operand 4510 states and 12419 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:03,803 INFO L93 Difference]: Finished difference Result 3460 states and 9570 transitions. [2023-11-23 21:12:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:12:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 21:12:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:03,823 INFO L225 Difference]: With dead ends: 3460 [2023-11-23 21:12:03,823 INFO L226 Difference]: Without dead ends: 3460 [2023-11-23 21:12:03,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:12:03,826 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 153 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:03,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 125 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:12:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2023-11-23 21:12:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3460. [2023-11-23 21:12:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3364 states have (on average 2.8448275862068964) internal successors, (9570), 3459 states have internal predecessors, (9570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 9570 transitions. [2023-11-23 21:12:03,929 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 9570 transitions. Word has length 16 [2023-11-23 21:12:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:03,930 INFO L495 AbstractCegarLoop]: Abstraction has 3460 states and 9570 transitions. [2023-11-23 21:12:03,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 9570 transitions. [2023-11-23 21:12:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 21:12:03,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:03,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:12:03,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:03,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131262, now seen corresponding path program 1 times [2023-11-23 21:12:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:03,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268116793] [2023-11-23 21:12:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:06,656 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-23 21:12:06,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268116793] [2023-11-23 21:12:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268116793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:12:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385531122] [2023-11-23 21:12:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:06,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:12:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:12:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:12:06,661 INFO L87 Difference]: Start difference. First operand 3460 states and 9570 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:08,523 INFO L93 Difference]: Finished difference Result 3634 states and 10027 transitions. [2023-11-23 21:12:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:12:08,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 21:12:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:08,545 INFO L225 Difference]: With dead ends: 3634 [2023-11-23 21:12:08,545 INFO L226 Difference]: Without dead ends: 3634 [2023-11-23 21:12:08,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:12:08,546 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 84 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:08,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 228 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-23 21:12:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2023-11-23 21:12:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3614. [2023-11-23 21:12:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3518 states have (on average 2.8388288800454804) internal successors, (9987), 3613 states have internal predecessors, (9987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 9987 transitions. [2023-11-23 21:12:08,702 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 9987 transitions. Word has length 17 [2023-11-23 21:12:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:08,702 INFO L495 AbstractCegarLoop]: Abstraction has 3614 states and 9987 transitions. [2023-11-23 21:12:08,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 9987 transitions. [2023-11-23 21:12:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:12:08,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:08,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:08,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:12:08,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:08,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash -320429711, now seen corresponding path program 1 times [2023-11-23 21:12:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684250101] [2023-11-23 21:12:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:09,857 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-23 21:12:09,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684250101] [2023-11-23 21:12:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684250101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:12:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11865237] [2023-11-23 21:12:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:12:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:12:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:12:09,861 INFO L87 Difference]: Start difference. First operand 3614 states and 9987 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:10,974 INFO L93 Difference]: Finished difference Result 5319 states and 14717 transitions. [2023-11-23 21:12:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:12:10,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:12:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:11,000 INFO L225 Difference]: With dead ends: 5319 [2023-11-23 21:12:11,000 INFO L226 Difference]: Without dead ends: 5319 [2023-11-23 21:12:11,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:12:11,001 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 223 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:11,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 266 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 21:12:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2023-11-23 21:12:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 4072. [2023-11-23 21:12:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 3976 states have (on average 2.8641851106639837) internal successors, (11388), 4071 states have internal predecessors, (11388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 11388 transitions. [2023-11-23 21:12:11,187 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 11388 transitions. Word has length 19 [2023-11-23 21:12:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:11,187 INFO L495 AbstractCegarLoop]: Abstraction has 4072 states and 11388 transitions. [2023-11-23 21:12:11,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 11388 transitions. [2023-11-23 21:12:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:12:11,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:11,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:11,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:12:11,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:11,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301932, now seen corresponding path program 1 times [2023-11-23 21:12:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771692725] [2023-11-23 21:12:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:11,349 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-23 21:12:11,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771692725] [2023-11-23 21:12:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771692725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:11,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:12:11,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550726504] [2023-11-23 21:12:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:11,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:12:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:11,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:12:11,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:12:11,352 INFO L87 Difference]: Start difference. First operand 4072 states and 11388 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:11,627 INFO L93 Difference]: Finished difference Result 3892 states and 10888 transitions. [2023-11-23 21:12:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:12:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:12:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:11,648 INFO L225 Difference]: With dead ends: 3892 [2023-11-23 21:12:11,648 INFO L226 Difference]: Without dead ends: 3892 [2023-11-23 21:12:11,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:12:11,649 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 108 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:11,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 66 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:12:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2023-11-23 21:12:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2023-11-23 21:12:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3804 states have (on average 2.8622502628811777) internal successors, (10888), 3891 states have internal predecessors, (10888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 10888 transitions. [2023-11-23 21:12:11,803 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 10888 transitions. Word has length 19 [2023-11-23 21:12:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:11,804 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 10888 transitions. [2023-11-23 21:12:11,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 10888 transitions. [2023-11-23 21:12:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:12:11,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:11,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:12:11,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:11,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301933, now seen corresponding path program 1 times [2023-11-23 21:12:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023104302] [2023-11-23 21:12:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:11,921 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-23 21:12:11,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023104302] [2023-11-23 21:12:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023104302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:12:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611793048] [2023-11-23 21:12:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:12:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:12:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:11,925 INFO L87 Difference]: Start difference. First operand 3892 states and 10888 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:12,033 INFO L93 Difference]: Finished difference Result 1210 states and 2922 transitions. [2023-11-23 21:12:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:12:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:12,042 INFO L225 Difference]: With dead ends: 1210 [2023-11-23 21:12:12,042 INFO L226 Difference]: Without dead ends: 1210 [2023-11-23 21:12:12,042 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-23 21:12:12,043 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:12,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2023-11-23 21:12:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1171. [2023-11-23 21:12:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1146 states have (on average 2.486910994764398) internal successors, (2850), 1170 states have internal predecessors, (2850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2850 transitions. [2023-11-23 21:12:12,086 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2850 transitions. Word has length 19 [2023-11-23 21:12:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:12,087 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 2850 transitions. [2023-11-23 21:12:12,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2850 transitions. [2023-11-23 21:12:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:12:12,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:12,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:12:12,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:12,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1790474273, now seen corresponding path program 1 times [2023-11-23 21:12:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:12,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416152942] [2023-11-23 21:12:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:12,929 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-23 21:12:12,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416152942] [2023-11-23 21:12:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416152942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:12:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249090575] [2023-11-23 21:12:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:12,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:12:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:12:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:12:12,932 INFO L87 Difference]: Start difference. First operand 1171 states and 2850 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:13,336 INFO L93 Difference]: Finished difference Result 1211 states and 2939 transitions. [2023-11-23 21:12:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:12:13,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 21:12:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:13,341 INFO L225 Difference]: With dead ends: 1211 [2023-11-23 21:12:13,341 INFO L226 Difference]: Without dead ends: 1211 [2023-11-23 21:12:13,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:12:13,342 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:13,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 219 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:12:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2023-11-23 21:12:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1201. [2023-11-23 21:12:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1176 states have (on average 2.483843537414966) internal successors, (2921), 1200 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2921 transitions. [2023-11-23 21:12:13,377 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2921 transitions. Word has length 24 [2023-11-23 21:12:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:13,378 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 2921 transitions. [2023-11-23 21:12:13,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2921 transitions. [2023-11-23 21:12:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:12:13,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:13,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:13,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:12:13,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:13,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1886579223, now seen corresponding path program 1 times [2023-11-23 21:12:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993818597] [2023-11-23 21:12:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:13,444 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-23 21:12:13,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993818597] [2023-11-23 21:12:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993818597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:12:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489045730] [2023-11-23 21:12:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:13,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:12:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:12:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:13,446 INFO L87 Difference]: Start difference. First operand 1201 states and 2921 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:13,558 INFO L93 Difference]: Finished difference Result 1455 states and 3548 transitions. [2023-11-23 21:12:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 21:12:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:13,564 INFO L225 Difference]: With dead ends: 1455 [2023-11-23 21:12:13,564 INFO L226 Difference]: Without dead ends: 1455 [2023-11-23 21:12:13,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:12:13,565 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:13,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2023-11-23 21:12:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1201. [2023-11-23 21:12:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1176 states have (on average 2.4634353741496597) internal successors, (2897), 1200 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2897 transitions. [2023-11-23 21:12:13,602 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2897 transitions. Word has length 24 [2023-11-23 21:12:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:13,603 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 2897 transitions. [2023-11-23 21:12:13,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2897 transitions. [2023-11-23 21:12:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 21:12:13,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:13,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:13,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:12:13,605 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:13,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -328796434, now seen corresponding path program 1 times [2023-11-23 21:12:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228565874] [2023-11-23 21:12:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:13,835 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-23 21:12:13,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228565874] [2023-11-23 21:12:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228565874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:13,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:13,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:12:13,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243311031] [2023-11-23 21:12:13,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:13,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:12:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:12:13,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:12:13,838 INFO L87 Difference]: Start difference. First operand 1201 states and 2897 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:13,959 INFO L93 Difference]: Finished difference Result 1165 states and 2811 transitions. [2023-11-23 21:12:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:12:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 21:12:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:13,963 INFO L225 Difference]: With dead ends: 1165 [2023-11-23 21:12:13,963 INFO L226 Difference]: Without dead ends: 1165 [2023-11-23 21:12:13,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:12:13,964 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:13,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 19 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:12:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-23 21:12:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2023-11-23 21:12:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1142 states have (on average 2.4614711033274954) internal successors, (2811), 1164 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 2811 transitions. [2023-11-23 21:12:13,998 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 2811 transitions. Word has length 25 [2023-11-23 21:12:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:13,998 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 2811 transitions. [2023-11-23 21:12:13,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 2811 transitions. [2023-11-23 21:12:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 21:12:14,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:14,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:14,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:12:14,002 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:14,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -328796433, now seen corresponding path program 1 times [2023-11-23 21:12:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970941466] [2023-11-23 21:12:14,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:14,528 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-23 21:12:14,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970941466] [2023-11-23 21:12:14,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970941466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:12:14,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:12:14,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:12:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695861691] [2023-11-23 21:12:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:12:14,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:12:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:14,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:12:14,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:12:14,534 INFO L87 Difference]: Start difference. First operand 1165 states and 2811 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:12:14,784 INFO L93 Difference]: Finished difference Result 1371 states and 3344 transitions. [2023-11-23 21:12:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:12:14,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 21:12:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:12:14,790 INFO L225 Difference]: With dead ends: 1371 [2023-11-23 21:12:14,790 INFO L226 Difference]: Without dead ends: 1371 [2023-11-23 21:12:14,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:12:14,791 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:12:14,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 35 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:12:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2023-11-23 21:12:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2023-11-23 21:12:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1348 states have (on average 2.4807121661721068) internal successors, (3344), 1370 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 3344 transitions. [2023-11-23 21:12:14,824 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 3344 transitions. Word has length 25 [2023-11-23 21:12:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:12:14,825 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 3344 transitions. [2023-11-23 21:12:14,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:12:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 3344 transitions. [2023-11-23 21:12:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 21:12:14,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:12:14,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:12:14,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:12:14,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-23 21:12:14,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:12:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1646577762, now seen corresponding path program 1 times [2023-11-23 21:12:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:12:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787873705] [2023-11-23 21:12:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:12:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:12:16,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:12:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787873705] [2023-11-23 21:12:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787873705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:12:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688096132] [2023-11-23 21:12:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:12:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:12:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:12:16,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:12:16,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee5dd62-1c26-4b6c-9201-c7f915f481c7/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:12:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:12:16,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 21:12:16,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:12:16,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:12:16,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 21:12:16,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 21:12:16,866 INFO L378 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 29 treesize of output 13 [2023-11-23 21:12:17,008 INFO L378 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-23 21:12:17,294 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:12:17,308 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-11-23 21:12:17,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-11-23 21:12:17,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:12:17,436 INFO L378 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 29 treesize of output 13 [2023-11-23 21:12:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-23 21:12:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:12:17,738 INFO L378 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-23 21:12:17,880 INFO L378 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 3 [2023-11-23 21:12:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:12:17,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:12:18,146 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_364 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_364 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-23 21:12:18,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_364 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_364 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-11-23 21:12:19,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:12:19,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2023-11-23 21:12:25,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_360 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (< (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 (+ v_prenex_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse1) 403)))))) (forall ((v_ArrVal_360 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_364 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse1) 4)))))))))) is different from false [2023-11-23 21:12:25,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse6 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_360 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int) (v_ArrVal_358 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse5 .cse6 v_ArrVal_358)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (< (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 (+ v_prenex_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse1) 403)))))) (forall ((v_ArrVal_360 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int) (v_ArrVal_358 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse5 .cse6 v_ArrVal_358)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_364 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_364) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|))))))) is different from false [2023-11-23 21:12:25,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:12:25,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 93 [2023-11-23 21:12:25,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:12:25,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 111 [2023-11-23 21:12:25,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-11-23 21:12:25,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-11-23 21:12:25,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-23 21:12:25,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:12:25,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 67 [2023-11-23 21:12:25,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:12:25,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 97 [2023-11-23 21:12:25,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:12:25,916 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:12:25,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-23 21:12:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:12:25,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-11-23 21:12:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:12:26,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688096132] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:12:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [903635608] [2023-11-23 21:12:26,046 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 21:12:26,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:12:26,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2023-11-23 21:12:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953492895] [2023-11-23 21:12:26,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:12:26,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-23 21:12:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:12:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-23 21:12:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1064, Unknown=59, NotChecked=284, Total=1560 [2023-11-23 21:12:26,058 INFO L87 Difference]: Start difference. First operand 1371 states and 3344 transitions. Second operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)