./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:45:06,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:45:06,665 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:45:06,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:45:06,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:45:06,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:45:06,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:45:06,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:45:06,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:45:06,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:45:06,722 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:45:06,722 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:45:06,723 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:45:06,725 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:45:06,726 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:45:06,726 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:45:06,726 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:45:06,727 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:45:06,727 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:45:06,727 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:45:06,728 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:45:06,728 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:45:06,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:45:06,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:45:06,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:45:06,731 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:45:06,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:45:06,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:45:06,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:45:06,732 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:45:06,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:45:06,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:45:06,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:45:06,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:45:06,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:45:06,734 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:45:06,735 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:45:06,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:45:06,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:45:06,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:45:06,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:45:06,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:45:06,737 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:45:06,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:45:06,738 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:45:06,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:45:06,738 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_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2023-11-12 00:45:07,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:45:07,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:45:07,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:45:07,035 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:45:07,036 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:45:07,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-12 00:45:10,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:45:10,441 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:45:10,442 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-12 00:45:10,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/data/fd121e48d/efaf0d85318348e8986ae0985de7ec28/FLAG5f4541775 [2023-11-12 00:45:10,483 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/data/fd121e48d/efaf0d85318348e8986ae0985de7ec28 [2023-11-12 00:45:10,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:45:10,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:45:10,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:45:10,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:45:10,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:45:10,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:10" (1/1) ... [2023-11-12 00:45:10,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d5288c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:10, skipping insertion in model container [2023-11-12 00:45:10,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:10" (1/1) ... [2023-11-12 00:45:10,588 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:45:11,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:45:11,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:45:11,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:45:11,372 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:45:11,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11 WrapperNode [2023-11-12 00:45:11,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:45:11,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:45:11,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:45:11,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:45:11,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,478 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2023-11-12 00:45:11,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:45:11,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:45:11,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:45:11,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:45:11,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:45:11,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:45:11,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:45:11,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:45:11,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (1/1) ... [2023-11-12 00:45:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:45:11,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:45:11,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:45:11,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:45:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-12 00:45:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-12 00:45:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-12 00:45:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-12 00:45:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:45:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:45:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:45:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:45:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-12 00:45:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:45:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:45:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:45:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:45:11,656 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:45:11,846 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:45:11,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:45:12,500 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:45:12,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:45:12,512 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:45:12,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:12 BoogieIcfgContainer [2023-11-12 00:45:12,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:45:12,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:45:12,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:45:12,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:45:12,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:45:10" (1/3) ... [2023-11-12 00:45:12,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efe54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:12, skipping insertion in model container [2023-11-12 00:45:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:11" (2/3) ... [2023-11-12 00:45:12,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efe54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:12, skipping insertion in model container [2023-11-12 00:45:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:12" (3/3) ... [2023-11-12 00:45:12,525 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-12 00:45:12,547 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:45:12,557 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-12 00:45:12,558 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:45:12,755 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 00:45:12,795 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:45:12,811 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 298 transitions, 610 flow [2023-11-12 00:45:12,814 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 298 transitions, 610 flow [2023-11-12 00:45:12,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 298 transitions, 610 flow [2023-11-12 00:45:12,935 INFO L124 PetriNetUnfolderBase]: 15/296 cut-off events. [2023-11-12 00:45:12,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 00:45:12,945 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-12 00:45:12,959 INFO L119 LiptonReduction]: Number of co-enabled transitions 19748 [2023-11-12 00:45:32,889 INFO L134 LiptonReduction]: Checked pairs total: 64649 [2023-11-12 00:45:32,889 INFO L136 LiptonReduction]: Total number of compositions: 485 [2023-11-12 00:45:32,899 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 232 flow [2023-11-12 00:45:33,143 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-12 00:45:33,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:45:33,177 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;@5ea8d81c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:45:33,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-12 00:45:33,199 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-12 00:45:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 00:45:33,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:33,205 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 00:45:33,206 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-12 00:45:33,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1349, now seen corresponding path program 1 times [2023-11-12 00:45:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541171] [2023-11-12 00:45:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:33,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541171] [2023-11-12 00:45:33,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:33,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:33,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 00:45:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316770152] [2023-11-12 00:45:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:45:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:45:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:45:33,467 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-12 00:45:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:33,760 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2023-11-12 00:45:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:45:33,763 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-12 00:45:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:33,821 INFO L225 Difference]: With dead ends: 2668 [2023-11-12 00:45:33,821 INFO L226 Difference]: Without dead ends: 2668 [2023-11-12 00:45:33,822 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-12 00:45:33,828 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 00:45:33,833 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-12 00:45:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2023-11-12 00:45:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2023-11-12 00:45:34,106 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-12 00:45:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2023-11-12 00:45:34,133 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2023-11-12 00:45:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:34,134 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2023-11-12 00:45:34,135 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-12 00:45:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2023-11-12 00:45:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:45:34,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:34,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:45:34,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:45:34,139 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-12 00:45:34,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1325533, now seen corresponding path program 1 times [2023-11-12 00:45:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087963833] [2023-11-12 00:45:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:34,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087963833] [2023-11-12 00:45:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087963833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510593338] [2023-11-12 00:45:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:34,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:34,478 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-12 00:45:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:34,622 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2023-11-12 00:45:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:34,623 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-12 00:45:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:34,650 INFO L225 Difference]: With dead ends: 2618 [2023-11-12 00:45:34,651 INFO L226 Difference]: Without dead ends: 2618 [2023-11-12 00:45:34,651 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-12 00:45:34,653 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-12 00:45:34,653 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-12 00:45:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2023-11-12 00:45:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2023-11-12 00:45:34,745 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-12 00:45:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2023-11-12 00:45:34,765 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2023-11-12 00:45:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:34,766 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2023-11-12 00:45:34,766 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-12 00:45:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2023-11-12 00:45:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:45:34,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:34,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:45:34,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:45:34,768 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-12 00:45:34,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1325534, now seen corresponding path program 1 times [2023-11-12 00:45:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314733828] [2023-11-12 00:45:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:34,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314733828] [2023-11-12 00:45:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314733828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:34,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268399823] [2023-11-12 00:45:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:34,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:34,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:34,965 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-12 00:45:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:35,118 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2023-11-12 00:45:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:35,119 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-12 00:45:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:35,146 INFO L225 Difference]: With dead ends: 2568 [2023-11-12 00:45:35,146 INFO L226 Difference]: Without dead ends: 2568 [2023-11-12 00:45:35,146 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-12 00:45:35,148 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-12 00:45:35,149 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-12 00:45:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2023-11-12 00:45:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2023-11-12 00:45:35,260 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-12 00:45:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2023-11-12 00:45:35,356 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2023-11-12 00:45:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:35,357 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2023-11-12 00:45:35,357 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-12 00:45:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2023-11-12 00:45:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:35,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:35,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:45:35,359 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-12 00:45:35,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858408, now seen corresponding path program 1 times [2023-11-12 00:45:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863989875] [2023-11-12 00:45:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:35,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863989875] [2023-11-12 00:45:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863989875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666399834] [2023-11-12 00:45:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:35,485 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-12 00:45:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:35,624 INFO L93 Difference]: Finished difference Result 2196 states and 6425 transitions. [2023-11-12 00:45:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:35,625 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-12 00:45:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:35,647 INFO L225 Difference]: With dead ends: 2196 [2023-11-12 00:45:35,648 INFO L226 Difference]: Without dead ends: 2196 [2023-11-12 00:45:35,648 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-12 00:45:35,649 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-12 00:45:35,650 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-12 00:45:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-11-12 00:45:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2023-11-12 00:45:35,737 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-12 00:45:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6425 transitions. [2023-11-12 00:45:35,752 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6425 transitions. Word has length 5 [2023-11-12 00:45:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 6425 transitions. [2023-11-12 00:45:35,753 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-12 00:45:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6425 transitions. [2023-11-12 00:45:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:35,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:35,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:45:35,755 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-12 00:45:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858409, now seen corresponding path program 1 times [2023-11-12 00:45:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898405549] [2023-11-12 00:45:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:35,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898405549] [2023-11-12 00:45:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898405549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420181664] [2023-11-12 00:45:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:35,813 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-12 00:45:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:35,928 INFO L93 Difference]: Finished difference Result 1930 states and 5670 transitions. [2023-11-12 00:45:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:35,928 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-12 00:45:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:35,948 INFO L225 Difference]: With dead ends: 1930 [2023-11-12 00:45:35,948 INFO L226 Difference]: Without dead ends: 1930 [2023-11-12 00:45:35,948 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-12 00:45:35,949 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-12 00:45:35,950 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-12 00:45:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2023-11-12 00:45:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2023-11-12 00:45:36,012 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-12 00:45:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5670 transitions. [2023-11-12 00:45:36,025 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5670 transitions. Word has length 5 [2023-11-12 00:45:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:36,025 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 5670 transitions. [2023-11-12 00:45:36,025 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-12 00:45:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5670 transitions. [2023-11-12 00:45:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:36,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:36,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:36,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:45:36,027 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-12 00:45:36,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1273858411, now seen corresponding path program 1 times [2023-11-12 00:45:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944170230] [2023-11-12 00:45:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:36,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944170230] [2023-11-12 00:45:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944170230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:36,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973256711] [2023-11-12 00:45:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:36,371 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-12 00:45:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:36,518 INFO L93 Difference]: Finished difference Result 1936 states and 5683 transitions. [2023-11-12 00:45:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:36,519 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-12 00:45:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:36,538 INFO L225 Difference]: With dead ends: 1936 [2023-11-12 00:45:36,538 INFO L226 Difference]: Without dead ends: 1936 [2023-11-12 00:45:36,539 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-12 00:45:36,539 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-12 00:45:36,540 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-12 00:45:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2023-11-12 00:45:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1931. [2023-11-12 00:45:36,603 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-12 00:45:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5673 transitions. [2023-11-12 00:45:36,615 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 5673 transitions. Word has length 5 [2023-11-12 00:45:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:36,615 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 5673 transitions. [2023-11-12 00:45:36,616 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-12 00:45:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 5673 transitions. [2023-11-12 00:45:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:36,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:36,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:36,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:45:36,617 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-12 00:45:36,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1273863485, now seen corresponding path program 1 times [2023-11-12 00:45:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753384353] [2023-11-12 00:45:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:36,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753384353] [2023-11-12 00:45:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753384353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226598543] [2023-11-12 00:45:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:45:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:45:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:45:36,685 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-12 00:45:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:36,796 INFO L93 Difference]: Finished difference Result 1471 states and 4187 transitions. [2023-11-12 00:45:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:36,797 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-12 00:45:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:36,808 INFO L225 Difference]: With dead ends: 1471 [2023-11-12 00:45:36,808 INFO L226 Difference]: Without dead ends: 1471 [2023-11-12 00:45:36,809 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-12 00:45:36,809 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-12 00:45:36,810 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-12 00:45:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2023-11-12 00:45:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2023-11-12 00:45:36,854 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-12 00:45:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4187 transitions. [2023-11-12 00:45:36,863 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4187 transitions. Word has length 5 [2023-11-12 00:45:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:36,863 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4187 transitions. [2023-11-12 00:45:36,863 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-12 00:45:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4187 transitions. [2023-11-12 00:45:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:45:36,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:36,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:45:36,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:45:36,864 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-12 00:45:36,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1273863486, now seen corresponding path program 1 times [2023-11-12 00:45:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:36,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870935223] [2023-11-12 00:45:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:36,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870935223] [2023-11-12 00:45:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870935223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472171898] [2023-11-12 00:45:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:45:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:36,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:45:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:45:36,970 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-12 00:45:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:37,073 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2023-11-12 00:45:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:37,074 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-12 00:45:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:37,081 INFO L225 Difference]: With dead ends: 1011 [2023-11-12 00:45:37,081 INFO L226 Difference]: Without dead ends: 1011 [2023-11-12 00:45:37,081 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-12 00:45:37,082 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-12 00:45:37,083 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-12 00:45:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-11-12 00:45:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2023-11-12 00:45:37,111 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-12 00:45:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2023-11-12 00:45:37,116 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2023-11-12 00:45:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:37,116 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2023-11-12 00:45:37,116 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-12 00:45:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2023-11-12 00:45:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:45:37,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:37,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:45:37,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:45:37,118 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-12 00:45:37,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash 834908119, now seen corresponding path program 1 times [2023-11-12 00:45:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422263858] [2023-11-12 00:45:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:37,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422263858] [2023-11-12 00:45:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422263858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556912353] [2023-11-12 00:45:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:37,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:45:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:45:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:45:37,308 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-12 00:45:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:37,483 INFO L93 Difference]: Finished difference Result 915 states and 2451 transitions. [2023-11-12 00:45:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:45:37,484 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-12 00:45:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:37,490 INFO L225 Difference]: With dead ends: 915 [2023-11-12 00:45:37,490 INFO L226 Difference]: Without dead ends: 915 [2023-11-12 00:45:37,490 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-12 00:45:37,491 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:37,491 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.1s Time] [2023-11-12 00:45:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2023-11-12 00:45:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2023-11-12 00:45:37,525 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-12 00:45:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2451 transitions. [2023-11-12 00:45:37,530 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2451 transitions. Word has length 6 [2023-11-12 00:45:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:37,530 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2451 transitions. [2023-11-12 00:45:37,530 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-12 00:45:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2451 transitions. [2023-11-12 00:45:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:45:37,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:37,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:45:37,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:45:37,531 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-12 00:45:37,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 834903676, now seen corresponding path program 1 times [2023-11-12 00:45:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077055021] [2023-11-12 00:45:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:37,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:37,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077055021] [2023-11-12 00:45:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077055021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:37,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972000544] [2023-11-12 00:45:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:45:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:45:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:45:37,874 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-12 00:45:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:38,020 INFO L93 Difference]: Finished difference Result 1190 states and 3172 transitions. [2023-11-12 00:45:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:45:38,021 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-12 00:45:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:38,026 INFO L225 Difference]: With dead ends: 1190 [2023-11-12 00:45:38,026 INFO L226 Difference]: Without dead ends: 1190 [2023-11-12 00:45:38,026 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-12 00:45:38,027 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-12 00:45:38,027 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-12 00:45:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2023-11-12 00:45:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 998. [2023-11-12 00:45:38,056 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-12 00:45:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2023-11-12 00:45:38,061 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2023-11-12 00:45:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:38,062 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2023-11-12 00:45:38,062 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-12 00:45:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2023-11-12 00:45:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:45:38,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:38,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:38,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:45:38,064 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-12 00:45:38,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 943287980, now seen corresponding path program 1 times [2023-11-12 00:45:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909194999] [2023-11-12 00:45:38,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:38,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909194999] [2023-11-12 00:45:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909194999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:38,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690262710] [2023-11-12 00:45:38,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:38,131 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-12 00:45:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:38,233 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2023-11-12 00:45:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:38,234 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-12 00:45:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:38,236 INFO L225 Difference]: With dead ends: 434 [2023-11-12 00:45:38,236 INFO L226 Difference]: Without dead ends: 426 [2023-11-12 00:45:38,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:38,237 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-12 00:45:38,237 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-12 00:45:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-11-12 00:45:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2023-11-12 00:45:38,249 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-12 00:45:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2023-11-12 00:45:38,251 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2023-11-12 00:45:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:38,251 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2023-11-12 00:45:38,251 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-12 00:45:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2023-11-12 00:45:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:45:38,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:38,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:38,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:45:38,253 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-12 00:45:38,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1889525560, now seen corresponding path program 1 times [2023-11-12 00:45:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111011733] [2023-11-12 00:45:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:38,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111011733] [2023-11-12 00:45:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111011733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:38,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:38,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:45:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277334667] [2023-11-12 00:45:38,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:38,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:45:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:38,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:45:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:45:38,365 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-12 00:45:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:38,441 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2023-11-12 00:45:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:45:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-12 00:45:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:38,443 INFO L225 Difference]: With dead ends: 380 [2023-11-12 00:45:38,444 INFO L226 Difference]: Without dead ends: 380 [2023-11-12 00:45:38,444 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-12 00:45:38,444 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:45:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-11-12 00:45:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2023-11-12 00:45:38,455 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-12 00:45:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2023-11-12 00:45:38,456 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2023-11-12 00:45:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:38,457 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2023-11-12 00:45:38,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-12 00:45:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2023-11-12 00:45:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:45:38,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:38,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:38,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:45:38,458 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-12 00:45:38,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1889525561, now seen corresponding path program 1 times [2023-11-12 00:45:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904237022] [2023-11-12 00:45:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:45:38,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904237022] [2023-11-12 00:45:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904237022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:45:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382272857] [2023-11-12 00:45:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:45:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:45:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:45:38,683 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-12 00:45:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:38,815 INFO L93 Difference]: Finished difference Result 476 states and 1106 transitions. [2023-11-12 00:45:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:45:38,816 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-12 00:45:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:38,818 INFO L225 Difference]: With dead ends: 476 [2023-11-12 00:45:38,818 INFO L226 Difference]: Without dead ends: 476 [2023-11-12 00:45:38,818 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-12 00:45:38,819 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-12 00:45:38,819 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-12 00:45:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-12 00:45:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2023-11-12 00:45:38,832 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-12 00:45:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1106 transitions. [2023-11-12 00:45:38,834 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1106 transitions. Word has length 11 [2023-11-12 00:45:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:38,835 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1106 transitions. [2023-11-12 00:45:38,835 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-12 00:45:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1106 transitions. [2023-11-12 00:45:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:45:38,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:38,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:38,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:45:38,836 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-12 00:45:38,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1554248519, now seen corresponding path program 1 times [2023-11-12 00:45:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651370130] [2023-11-12 00:45:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:39,367 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-12 00:45:39,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651370130] [2023-11-12 00:45:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651370130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:45:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:45:39,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:45:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483665466] [2023-11-12 00:45:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:45:39,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:45:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:45:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:45:39,370 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-12 00:45:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:45:39,591 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2023-11-12 00:45:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:45:39,592 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-12 00:45:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:45:39,594 INFO L225 Difference]: With dead ends: 475 [2023-11-12 00:45:39,594 INFO L226 Difference]: Without dead ends: 475 [2023-11-12 00:45:39,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:45:39,595 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:45:39,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 16 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:45:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-11-12 00:45:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2023-11-12 00:45:39,609 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-12 00:45:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2023-11-12 00:45:39,611 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2023-11-12 00:45:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:45:39,611 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2023-11-12 00:45:39,612 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-12 00:45:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2023-11-12 00:45:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:45:39,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:45:39,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:45:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:45:39,613 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-12 00:45:39,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:45:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -943496091, now seen corresponding path program 1 times [2023-11-12 00:45:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:45:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116274317] [2023-11-12 00:45:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:45:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:40,746 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-12 00:45:40,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:45:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116274317] [2023-11-12 00:45:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116274317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:45:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188058046] [2023-11-12 00:45:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:45:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:45:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:45:40,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:45:40,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bba8049-6922-4546-8264-f4c4f35f4de6/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:45:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:45:40,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 00:45:40,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:45:40,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:40,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:40,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-12 00:45:41,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:41,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:41,063 INFO L322 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2023-11-12 00:45:41,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 113 [2023-11-12 00:45:41,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-12 00:45:41,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:41,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2023-11-12 00:45:41,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-12 00:45:41,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:41,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:41,976 INFO L322 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-11-12 00:45:41,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 270 treesize of output 259 [2023-11-12 00:45:42,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 190 [2023-11-12 00:45:43,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 264 [2023-11-12 00:45:44,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:45:44,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 480 [2023-11-12 00:45:44,748 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-12 00:45:44,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:45:46,508 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:45:46,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2023-11-12 00:45:47,238 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-12 00:45:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188058046] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:45:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259089434] [2023-11-12 00:45:47,247 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:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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-12 00:45:47,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:45:47,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-12 00:45:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441695974] [2023-11-12 00:45:47,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:45:47,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 00:45:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:45:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 00:45:47,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=496, Unknown=27, NotChecked=0, Total=650 [2023-11-12 00:45:47,276 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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)