./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ --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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:22:38,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:22:38,513 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:22:38,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:22:38,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:22:38,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:22:38,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:22:38,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:22:38,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:22:38,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:22:38,558 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:22:38,559 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:22:38,559 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:22:38,560 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:22:38,561 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:22:38,562 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:22:38,562 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:22:38,563 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:22:38,564 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:22:38,564 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:22:38,565 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:22:38,566 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:22:38,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:22:38,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:22:38,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:22:38,569 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:22:38,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:22:38,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:22:38,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:22:38,572 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:22:38,572 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:22:38,573 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:22:38,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:22:38,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:22:38,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:22:38,575 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:22:38,575 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:22:38,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:22:38,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:22:38,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:22:38,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:22:38,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:22:38,577 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:22:38,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:22:38,578 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:22:38,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:22:38,579 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_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/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_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2023-11-19 05:22:38,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:22:38,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:22:38,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:22:38,901 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:22:38,903 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:22:38,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread/queue_ok.i [2023-11-19 05:22:42,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:22:43,171 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:22:43,172 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/sv-benchmarks/c/pthread/queue_ok.i [2023-11-19 05:22:43,204 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/data/c3000e149/f26ecb1cfbba4f50a81f09c72e88e6f6/FLAGe79773f9f [2023-11-19 05:22:43,221 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/data/c3000e149/f26ecb1cfbba4f50a81f09c72e88e6f6 [2023-11-19 05:22:43,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:22:43,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:22:43,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:22:43,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:22:43,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:22:43,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:22:43" (1/1) ... [2023-11-19 05:22:43,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15565fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:43, skipping insertion in model container [2023-11-19 05:22:43,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:22:43" (1/1) ... [2023-11-19 05:22:43,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:22:43,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:22:43,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:22:43,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:22:44,066 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:22:44,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44 WrapperNode [2023-11-19 05:22:44,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:22:44,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:22:44,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:22:44,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:22:44,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,150 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2023-11-19 05:22:44,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:22:44,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:22:44,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:22:44,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:22:44,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:22:44,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:22:44,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:22:44,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:22:44,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (1/1) ... [2023-11-19 05:22:44,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:22:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:22:44,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:22:44,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:22:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-19 05:22:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-19 05:22:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-19 05:22:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-19 05:22:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:22:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:22:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:22:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:22:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 05:22:44,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:22:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:22:44,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:22:44,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:22:44,384 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:22:44,633 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:22:44,635 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:22:45,216 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:22:45,231 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:22:45,244 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 05:22:45,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:22:45 BoogieIcfgContainer [2023-11-19 05:22:45,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:22:45,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:22:45,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:22:45,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:22:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:22:43" (1/3) ... [2023-11-19 05:22:45,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee8100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:22:45, skipping insertion in model container [2023-11-19 05:22:45,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:22:44" (2/3) ... [2023-11-19 05:22:45,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee8100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:22:45, skipping insertion in model container [2023-11-19 05:22:45,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:22:45" (3/3) ... [2023-11-19 05:22:45,262 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-19 05:22:45,286 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:22:45,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-19 05:22:45,286 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:22:45,494 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 05:22:45,547 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:22:45,569 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 298 transitions, 610 flow [2023-11-19 05:22:45,574 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 298 transitions, 610 flow [2023-11-19 05:22:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 298 transitions, 610 flow [2023-11-19 05:22:45,798 INFO L124 PetriNetUnfolderBase]: 15/296 cut-off events. [2023-11-19 05:22:45,798 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 05:22:45,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 296 events. 15/296 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 704 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 196. Up to 3 conditions per place. [2023-11-19 05:22:45,832 INFO L119 LiptonReduction]: Number of co-enabled transitions 19748 [2023-11-19 05:23:05,689 INFO L134 LiptonReduction]: Checked pairs total: 64649 [2023-11-19 05:23:05,689 INFO L136 LiptonReduction]: Total number of compositions: 485 [2023-11-19 05:23:05,698 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 232 flow [2023-11-19 05:23:05,935 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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-19 05:23:05,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:23:05,963 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;@75de1b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:23:05,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-19 05:23:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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-19 05:23:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 05:23:05,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:05,989 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 05:23:05,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:05,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1349, now seen corresponding path program 1 times [2023-11-19 05:23:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:06,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953672406] [2023-11-19 05:23:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:06,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:06,144 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-19 05:23:06,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953672406] [2023-11-19 05:23:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953672406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 05:23:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669319902] [2023-11-19 05:23:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:06,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:23:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:23:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:23:06,214 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-19 05:23:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:06,503 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2023-11-19 05:23:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2023-11-19 05:23:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:06,562 INFO L225 Difference]: With dead ends: 2668 [2023-11-19 05:23:06,562 INFO L226 Difference]: Without dead ends: 2668 [2023-11-19 05:23:06,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:23:06,569 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:06,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:23:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2023-11-19 05:23:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2023-11-19 05:23:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 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-19 05:23:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2023-11-19 05:23:06,804 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2023-11-19 05:23:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:06,805 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2023-11-19 05:23:06,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-19 05:23:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2023-11-19 05:23:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 05:23:06,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:06,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 05:23:06,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:23:06,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:06,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1325533, now seen corresponding path program 1 times [2023-11-19 05:23:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633592179] [2023-11-19 05:23:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:07,026 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-19 05:23:07,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:07,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633592179] [2023-11-19 05:23:07,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633592179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:07,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:07,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517472407] [2023-11-19 05:23:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:07,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:07,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:07,030 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-19 05:23:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:07,186 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2023-11-19 05:23:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:07,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-11-19 05:23:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:07,217 INFO L225 Difference]: With dead ends: 2618 [2023-11-19 05:23:07,217 INFO L226 Difference]: Without dead ends: 2618 [2023-11-19 05:23:07,218 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-19 05:23:07,220 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:07,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2023-11-19 05:23:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2023-11-19 05:23:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 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-19 05:23:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2023-11-19 05:23:07,363 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2023-11-19 05:23:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:07,364 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2023-11-19 05:23:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-19 05:23:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2023-11-19 05:23:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 05:23:07,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:07,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 05:23:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:23:07,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:07,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1325534, now seen corresponding path program 1 times [2023-11-19 05:23:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:07,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359807978] [2023-11-19 05:23:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:07,566 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-19 05:23:07,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:07,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359807978] [2023-11-19 05:23:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359807978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925381419] [2023-11-19 05:23:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:07,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:07,569 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-19 05:23:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:07,704 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2023-11-19 05:23:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-11-19 05:23:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:07,729 INFO L225 Difference]: With dead ends: 2568 [2023-11-19 05:23:07,730 INFO L226 Difference]: Without dead ends: 2568 [2023-11-19 05:23:07,730 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-19 05:23:07,731 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:07,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2023-11-19 05:23:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2023-11-19 05:23:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 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-19 05:23:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2023-11-19 05:23:07,904 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2023-11-19 05:23:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:07,904 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2023-11-19 05:23:07,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-19 05:23:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2023-11-19 05:23:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:07,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:07,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:07,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:23:07,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:07,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858408, now seen corresponding path program 1 times [2023-11-19 05:23:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008226400] [2023-11-19 05:23:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:08,015 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-19 05:23:08,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008226400] [2023-11-19 05:23:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008226400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110750751] [2023-11-19 05:23:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:08,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:08,018 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:08,145 INFO L93 Difference]: Finished difference Result 2196 states and 6425 transitions. [2023-11-19 05:23:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:08,165 INFO L225 Difference]: With dead ends: 2196 [2023-11-19 05:23:08,165 INFO L226 Difference]: Without dead ends: 2196 [2023-11-19 05:23:08,166 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-19 05:23:08,167 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:08,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-11-19 05:23:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2023-11-19 05:23:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2007 states have (on average 3.201295465869457) internal successors, (6425), 2195 states have internal predecessors, (6425), 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-19 05:23:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6425 transitions. [2023-11-19 05:23:08,251 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6425 transitions. Word has length 5 [2023-11-19 05:23:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:08,252 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 6425 transitions. [2023-11-19 05:23:08,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6425 transitions. [2023-11-19 05:23:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:08,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:08,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:23:08,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:08,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858409, now seen corresponding path program 1 times [2023-11-19 05:23:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575058510] [2023-11-19 05:23:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:08,317 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-19 05:23:08,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575058510] [2023-11-19 05:23:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575058510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871339013] [2023-11-19 05:23:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:08,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:08,319 INFO L87 Difference]: Start difference. First operand 2196 states and 6425 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:08,417 INFO L93 Difference]: Finished difference Result 1930 states and 5670 transitions. [2023-11-19 05:23:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:08,435 INFO L225 Difference]: With dead ends: 1930 [2023-11-19 05:23:08,435 INFO L226 Difference]: Without dead ends: 1930 [2023-11-19 05:23:08,436 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-19 05:23:08,437 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:08,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2023-11-19 05:23:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2023-11-19 05:23:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1804 states have (on average 3.1430155210643016) internal successors, (5670), 1929 states have internal predecessors, (5670), 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-19 05:23:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5670 transitions. [2023-11-19 05:23:08,504 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5670 transitions. Word has length 5 [2023-11-19 05:23:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:08,504 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 5670 transitions. [2023-11-19 05:23:08,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5670 transitions. [2023-11-19 05:23:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:08,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:08,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:08,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:23:08,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:08,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858411, now seen corresponding path program 1 times [2023-11-19 05:23:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:08,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352340409] [2023-11-19 05:23:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:08,909 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-19 05:23:08,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352340409] [2023-11-19 05:23:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352340409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965407856] [2023-11-19 05:23:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:08,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:08,918 INFO L87 Difference]: Start difference. First operand 1930 states and 5670 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:09,100 INFO L93 Difference]: Finished difference Result 1936 states and 5683 transitions. [2023-11-19 05:23:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:09,130 INFO L225 Difference]: With dead ends: 1936 [2023-11-19 05:23:09,131 INFO L226 Difference]: Without dead ends: 1936 [2023-11-19 05:23:09,131 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-19 05:23:09,132 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:09,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2023-11-19 05:23:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1931. [2023-11-19 05:23:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1805 states have (on average 3.1429362880886424) internal successors, (5673), 1930 states have internal predecessors, (5673), 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-19 05:23:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5673 transitions. [2023-11-19 05:23:09,203 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 5673 transitions. Word has length 5 [2023-11-19 05:23:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:09,203 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 5673 transitions. [2023-11-19 05:23:09,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-19 05:23:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 5673 transitions. [2023-11-19 05:23:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:09,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:09,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:09,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:23:09,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:09,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1273863485, now seen corresponding path program 1 times [2023-11-19 05:23:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826002387] [2023-11-19 05:23:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:09,300 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-19 05:23:09,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826002387] [2023-11-19 05:23:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826002387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781225509] [2023-11-19 05:23:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:09,303 INFO L87 Difference]: Start difference. First operand 1931 states and 5673 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-19 05:23:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:09,408 INFO L93 Difference]: Finished difference Result 1471 states and 4187 transitions. [2023-11-19 05:23:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:09,408 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-19 05:23:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:09,418 INFO L225 Difference]: With dead ends: 1471 [2023-11-19 05:23:09,418 INFO L226 Difference]: Without dead ends: 1471 [2023-11-19 05:23:09,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:09,420 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:09,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2023-11-19 05:23:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2023-11-19 05:23:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1387 states have (on average 3.0187454938716654) internal successors, (4187), 1470 states have internal predecessors, (4187), 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-19 05:23:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4187 transitions. [2023-11-19 05:23:09,470 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4187 transitions. Word has length 5 [2023-11-19 05:23:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:09,471 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4187 transitions. [2023-11-19 05:23:09,471 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-19 05:23:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4187 transitions. [2023-11-19 05:23:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:09,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:09,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:09,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:23:09,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:09,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1273863486, now seen corresponding path program 1 times [2023-11-19 05:23:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71485360] [2023-11-19 05:23:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:09,565 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-19 05:23:09,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:09,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71485360] [2023-11-19 05:23:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71485360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:09,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143669507] [2023-11-19 05:23:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:09,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:09,568 INFO L87 Difference]: Start difference. First operand 1471 states and 4187 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-19 05:23:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:09,651 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2023-11-19 05:23:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:09,652 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-19 05:23:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:09,658 INFO L225 Difference]: With dead ends: 1011 [2023-11-19 05:23:09,658 INFO L226 Difference]: Without dead ends: 1011 [2023-11-19 05:23:09,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:09,661 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:09,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-11-19 05:23:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2023-11-19 05:23:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 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-19 05:23:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2023-11-19 05:23:09,701 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2023-11-19 05:23:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:09,702 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2023-11-19 05:23:09,702 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-19 05:23:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2023-11-19 05:23:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:23:09,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:09,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:23:09,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:23:09,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:09,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash 834908119, now seen corresponding path program 1 times [2023-11-19 05:23:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765650003] [2023-11-19 05:23:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:09,783 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-19 05:23:09,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765650003] [2023-11-19 05:23:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765650003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:09,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764778145] [2023-11-19 05:23:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:09,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:09,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:09,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:09,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:09,786 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 05:23:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:09,964 INFO L93 Difference]: Finished difference Result 915 states and 2451 transitions. [2023-11-19 05:23:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:09,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-19 05:23:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:09,970 INFO L225 Difference]: With dead ends: 915 [2023-11-19 05:23:09,970 INFO L226 Difference]: Without dead ends: 915 [2023-11-19 05:23:09,970 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-19 05:23:09,971 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:09,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 10 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:23:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2023-11-19 05:23:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2023-11-19 05:23:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 887 states have (on average 2.763246899661781) internal successors, (2451), 914 states have internal predecessors, (2451), 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-19 05:23:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2451 transitions. [2023-11-19 05:23:10,000 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2451 transitions. Word has length 6 [2023-11-19 05:23:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:10,000 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2451 transitions. [2023-11-19 05:23:10,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 05:23:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2451 transitions. [2023-11-19 05:23:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:23:10,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:10,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:23:10,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:23:10,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:10,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 834903676, now seen corresponding path program 1 times [2023-11-19 05:23:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627347127] [2023-11-19 05:23:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:10,314 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-19 05:23:10,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627347127] [2023-11-19 05:23:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627347127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:10,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125240023] [2023-11-19 05:23:10,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:10,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:10,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:10,316 INFO L87 Difference]: Start difference. First operand 915 states and 2451 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 05:23:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:10,459 INFO L93 Difference]: Finished difference Result 1190 states and 3172 transitions. [2023-11-19 05:23:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-19 05:23:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:10,464 INFO L225 Difference]: With dead ends: 1190 [2023-11-19 05:23:10,464 INFO L226 Difference]: Without dead ends: 1190 [2023-11-19 05:23:10,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:10,465 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:10,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2023-11-19 05:23:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 998. [2023-11-19 05:23:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 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-19 05:23:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2023-11-19 05:23:10,500 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2023-11-19 05:23:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:10,500 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2023-11-19 05:23:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 05:23:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2023-11-19 05:23:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:23:10,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:10,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:23:10,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:10,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 943287980, now seen corresponding path program 1 times [2023-11-19 05:23:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016305544] [2023-11-19 05:23:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:10,564 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-19 05:23:10,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016305544] [2023-11-19 05:23:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016305544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:10,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276168235] [2023-11-19 05:23:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:10,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:10,566 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-19 05:23:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:10,659 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2023-11-19 05:23:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:10,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-19 05:23:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:10,662 INFO L225 Difference]: With dead ends: 434 [2023-11-19 05:23:10,662 INFO L226 Difference]: Without dead ends: 426 [2023-11-19 05:23:10,662 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-19 05:23:10,663 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:10,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-11-19 05:23:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2023-11-19 05:23:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 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-19 05:23:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2023-11-19 05:23:10,676 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2023-11-19 05:23:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:10,676 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2023-11-19 05:23:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-19 05:23:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2023-11-19 05:23:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:23:10,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:10,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:10,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:23:10,678 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:10,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1889525560, now seen corresponding path program 1 times [2023-11-19 05:23:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571409863] [2023-11-19 05:23:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:11,085 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-19 05:23:11,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571409863] [2023-11-19 05:23:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571409863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:23:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381688618] [2023-11-19 05:23:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:11,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:23:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:23:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:23:11,088 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-19 05:23:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:11,217 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2023-11-19 05:23:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2023-11-19 05:23:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:11,219 INFO L225 Difference]: With dead ends: 380 [2023-11-19 05:23:11,219 INFO L226 Difference]: Without dead ends: 380 [2023-11-19 05:23:11,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:23:11,220 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:11,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 9 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-11-19 05:23:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2023-11-19 05:23:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 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-19 05:23:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2023-11-19 05:23:11,232 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2023-11-19 05:23:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:11,233 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2023-11-19 05:23:11,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-19 05:23:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2023-11-19 05:23:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:23:11,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:11,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:23:11,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:11,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1889525561, now seen corresponding path program 1 times [2023-11-19 05:23:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618170806] [2023-11-19 05:23:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:11,406 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-19 05:23:11,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618170806] [2023-11-19 05:23:11,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618170806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:11,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:11,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:23:11,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745428687] [2023-11-19 05:23:11,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:11,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:11,409 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 05:23:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:11,527 INFO L93 Difference]: Finished difference Result 476 states and 1106 transitions. [2023-11-19 05:23:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-11-19 05:23:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:11,529 INFO L225 Difference]: With dead ends: 476 [2023-11-19 05:23:11,529 INFO L226 Difference]: Without dead ends: 476 [2023-11-19 05:23:11,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:11,530 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:11,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-19 05:23:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2023-11-19 05:23:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 466 states have (on average 2.3733905579399144) internal successors, (1106), 475 states have internal predecessors, (1106), 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-19 05:23:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1106 transitions. [2023-11-19 05:23:11,545 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1106 transitions. Word has length 11 [2023-11-19 05:23:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:11,545 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1106 transitions. [2023-11-19 05:23:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 05:23:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1106 transitions. [2023-11-19 05:23:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:23:11,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:11,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:11,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:23:11,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:11,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1554248519, now seen corresponding path program 1 times [2023-11-19 05:23:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973423557] [2023-11-19 05:23:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:11,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973423557] [2023-11-19 05:23:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973423557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:11,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484107046] [2023-11-19 05:23:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:11,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:23:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:23:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:23:11,905 INFO L87 Difference]: Start difference. First operand 476 states and 1106 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-19 05:23:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:12,073 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2023-11-19 05:23:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:23:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-19 05:23:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:12,075 INFO L225 Difference]: With dead ends: 475 [2023-11-19 05:23:12,075 INFO L226 Difference]: Without dead ends: 475 [2023-11-19 05:23:12,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:23:12,076 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:12,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:23:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-11-19 05:23:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2023-11-19 05:23:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 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-19 05:23:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2023-11-19 05:23:12,091 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2023-11-19 05:23:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:12,091 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2023-11-19 05:23:12,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-19 05:23:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2023-11-19 05:23:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:23:12,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:12,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:12,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:23:12,093 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-19 05:23:12,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash -943496091, now seen corresponding path program 1 times [2023-11-19 05:23:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:12,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428141671] [2023-11-19 05:23:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:12,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428141671] [2023-11-19 05:23:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428141671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:23:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633842763] [2023-11-19 05:23:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:12,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:23:12,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_367b66f9-36e6-41d7-8c52-4c598013962c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:23:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:13,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-19 05:23:13,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:23:13,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:13,480 INFO L349 Elim1Store]: treesize reduction 136, result has 43.8 percent of original size [2023-11-19 05:23:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 255 [2023-11-19 05:23:13,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 05:23:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:14,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:14,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:14,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 110 [2023-11-19 05:23:14,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:14,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 110 [2023-11-19 05:23:16,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:16,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:17,243 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2023-11-19 05:23:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 613 treesize of output 579 [2023-11-19 05:23:17,275 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 504 treesize of output 502 [2023-11-19 05:23:17,315 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 502 treesize of output 500 [2023-11-19 05:23:17,352 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 500 treesize of output 498 [2023-11-19 05:23:17,378 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 498 treesize of output 496 [2023-11-19 05:23:17,412 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 496 treesize of output 494 [2023-11-19 05:23:18,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 340 [2023-11-19 05:23:19,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:19,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 363 [2023-11-19 05:23:20,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:23:20,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 848 treesize of output 743 [2023-11-19 05:23:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:21,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:23:21,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_274 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_274 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-19 05:23:21,437 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| Int) (v_ArrVal_274 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| Int) (v_ArrVal_274 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-11-19 05:23:21,467 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_269 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| Int) (v_ArrVal_274 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_269))) (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_269 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| Int) (v_ArrVal_274 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_269))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_1772| 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_274) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-19 05:23:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633842763] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:23:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063318446] [2023-11-19 05:23:23,015 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-19 05:23:23,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:23:23,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-11-19 05:23:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047829235] [2023-11-19 05:23:23,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:23:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-19 05:23:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 05:23:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=257, Unknown=15, NotChecked=108, Total=462 [2023-11-19 05:23:23,024 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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)