./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E --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 c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:51:14,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:51:14,294 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:51:14,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:51:14,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:51:14,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:51:14,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:51:14,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:51:14,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:51:14,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:51:14,351 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:51:14,351 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:51:14,351 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:51:14,352 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:51:14,352 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:51:14,353 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:51:14,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:51:14,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:51:14,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:51:14,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:51:14,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:51:14,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:51:14,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:51:14,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:51:14,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:51:14,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:51:14,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:51:14,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:51:14,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:51:14,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:51:14,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:51:14,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:51:14,357 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:51:14,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:51:14,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:51:14,358 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:51:14,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:51:14,358 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E 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 -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2024-11-14 05:51:14,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:51:14,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:51:14,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:51:14,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:51:14,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:51:14,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i Unable to find full path for "g++" [2024-11-14 05:51:16,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:51:17,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:51:17,330 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-11-14 05:51:17,354 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/data/3bfad025d/0133bd0e123c42bf8bc26e2c49299390/FLAG6ed2edbd9 [2024-11-14 05:51:17,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/data/3bfad025d/0133bd0e123c42bf8bc26e2c49299390 [2024-11-14 05:51:17,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:51:17,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:51:17,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:51:17,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:51:17,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:51:17,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:51:17" (1/1) ... [2024-11-14 05:51:17,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d2c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:17, skipping insertion in model container [2024-11-14 05:51:17,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:51:17" (1/1) ... [2024-11-14 05:51:17,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:51:18,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:51:18,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:51:18,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:51:18,528 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:51:18,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18 WrapperNode [2024-11-14 05:51:18,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:51:18,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:51:18,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:51:18,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:51:18,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,604 INFO L138 Inliner]: procedures = 372, calls = 118, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2024-11-14 05:51:18,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:51:18,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:51:18,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:51:18,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:51:18,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:51:18,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:51:18,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:51:18,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:51:18,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (1/1) ... [2024-11-14 05:51:18,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:51:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:18,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:51:18,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:51:18,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:51:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:51:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-14 05:51:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-14 05:51:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:51:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:51:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:51:18,763 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 05:51:18,964 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:51:18,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:51:19,668 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 05:51:19,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:51:20,582 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:51:20,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:51:20,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:20 BoogieIcfgContainer [2024-11-14 05:51:20,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:51:20,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:51:20,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:51:20,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:51:20,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:51:17" (1/3) ... [2024-11-14 05:51:20,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c7c5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:20, skipping insertion in model container [2024-11-14 05:51:20,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:18" (2/3) ... [2024-11-14 05:51:20,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c7c5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:20, skipping insertion in model container [2024-11-14 05:51:20,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:20" (3/3) ... [2024-11-14 05:51:20,601 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.i [2024-11-14 05:51:20,621 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:51:20,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr-deref.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 37 error locations. [2024-11-14 05:51:20,623 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 05:51:20,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 05:51:20,758 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 71 transitions, 146 flow [2024-11-14 05:51:20,844 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 435 states, 314 states have (on average 2.5477707006369426) internal successors, (800), 434 states have internal predecessors, (800), 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) [2024-11-14 05:51:20,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:51:20,901 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@71c6de17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:51:20,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-14 05:51:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 314 states have (on average 2.5477707006369426) internal successors, (800), 434 states have internal predecessors, (800), 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) [2024-11-14 05:51:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:51:20,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:20,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:51:20,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 557743, now seen corresponding path program 1 times [2024-11-14 05:51:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473354367] [2024-11-14 05:51:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:21,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473354367] [2024-11-14 05:51:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473354367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:21,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:51:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713424463] [2024-11-14 05:51:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:21,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:21,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:21,480 INFO L87 Difference]: Start difference. First operand has 435 states, 314 states have (on average 2.5477707006369426) internal successors, (800), 434 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) 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) [2024-11-14 05:51:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:21,635 INFO L93 Difference]: Finished difference Result 869 states and 1599 transitions. [2024-11-14 05:51:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:21,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) 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 [2024-11-14 05:51:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:21,695 INFO L225 Difference]: With dead ends: 869 [2024-11-14 05:51:21,695 INFO L226 Difference]: Without dead ends: 436 [2024-11-14 05:51:21,703 INFO L431 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 [2024-11-14 05:51:21,707 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:21,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-14 05:51:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2024-11-14 05:51:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 315 states have (on average 2.5428571428571427) internal successors, (801), 435 states have internal predecessors, (801), 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) [2024-11-14 05:51:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 801 transitions. [2024-11-14 05:51:21,812 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 801 transitions. Word has length 3 [2024-11-14 05:51:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:21,812 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 801 transitions. [2024-11-14 05:51:21,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) 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) [2024-11-14 05:51:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 801 transitions. [2024-11-14 05:51:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 05:51:21,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:21,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 05:51:21,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:51:21,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:21,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash 17287792, now seen corresponding path program 1 times [2024-11-14 05:51:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:21,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146123739] [2024-11-14 05:51:21,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:22,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146123739] [2024-11-14 05:51:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146123739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916527695] [2024-11-14 05:51:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:22,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:51:22,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:51:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:22,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:51:22,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:22,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916527695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:51:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1977453414] [2024-11-14 05:51:22,431 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:51:22,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:51:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-14 05:51:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249755300] [2024-11-14 05:51:22,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:51:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:51:22,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:51:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:51:22,441 INFO L87 Difference]: Start difference. First operand 436 states and 801 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2024-11-14 05:51:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:22,581 INFO L93 Difference]: Finished difference Result 872 states and 1604 transitions. [2024-11-14 05:51:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:51:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 4 [2024-11-14 05:51:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:22,589 INFO L225 Difference]: With dead ends: 872 [2024-11-14 05:51:22,589 INFO L226 Difference]: Without dead ends: 439 [2024-11-14 05:51:22,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:51:22,592 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:22,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-14 05:51:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-14 05:51:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 318 states have (on average 2.5283018867924527) internal successors, (804), 438 states have internal predecessors, (804), 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) [2024-11-14 05:51:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 804 transitions. [2024-11-14 05:51:22,628 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 804 transitions. Word has length 4 [2024-11-14 05:51:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 804 transitions. [2024-11-14 05:51:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2024-11-14 05:51:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 804 transitions. [2024-11-14 05:51:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:51:22,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:22,630 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1] [2024-11-14 05:51:22,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 05:51:22,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:22,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:22,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -377689361, now seen corresponding path program 2 times [2024-11-14 05:51:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:22,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463904415] [2024-11-14 05:51:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:51:23,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463904415] [2024-11-14 05:51:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463904415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:51:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730251338] [2024-11-14 05:51:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:23,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:23,061 INFO L87 Difference]: Start difference. First operand 439 states and 804 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:51:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:23,228 INFO L93 Difference]: Finished difference Result 439 states and 804 transitions. [2024-11-14 05:51:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2024-11-14 05:51:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:23,238 INFO L225 Difference]: With dead ends: 439 [2024-11-14 05:51:23,238 INFO L226 Difference]: Without dead ends: 435 [2024-11-14 05:51:23,239 INFO L431 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 [2024-11-14 05:51:23,240 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:23,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-14 05:51:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2024-11-14 05:51:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 318 states have (on average 2.5157232704402515) internal successors, (800), 434 states have internal predecessors, (800), 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) [2024-11-14 05:51:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 800 transitions. [2024-11-14 05:51:23,281 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 800 transitions. Word has length 7 [2024-11-14 05:51:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:23,281 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 800 transitions. [2024-11-14 05:51:23,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:51:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 800 transitions. [2024-11-14 05:51:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:51:23,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:23,285 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1] [2024-11-14 05:51:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:51:23,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:23,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -377689360, now seen corresponding path program 1 times [2024-11-14 05:51:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382184124] [2024-11-14 05:51:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:23,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382184124] [2024-11-14 05:51:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382184124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169865963] [2024-11-14 05:51:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:23,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:51:23,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:51:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:23,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:51:23,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:23,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169865963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:51:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1605402473] [2024-11-14 05:51:23,837 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-14 05:51:23,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:51:23,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-14 05:51:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68230788] [2024-11-14 05:51:23,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:51:23,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:51:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:51:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:51:23,839 INFO L87 Difference]: Start difference. First operand 435 states and 800 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2024-11-14 05:51:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:24,015 INFO L93 Difference]: Finished difference Result 870 states and 1605 transitions. [2024-11-14 05:51:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:51:24,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 7 [2024-11-14 05:51:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:24,020 INFO L225 Difference]: With dead ends: 870 [2024-11-14 05:51:24,020 INFO L226 Difference]: Without dead ends: 441 [2024-11-14 05:51:24,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:51:24,022 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:24,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-14 05:51:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-14 05:51:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 324 states have (on average 2.4876543209876543) internal successors, (806), 440 states have internal predecessors, (806), 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) [2024-11-14 05:51:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 806 transitions. [2024-11-14 05:51:24,047 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 806 transitions. Word has length 7 [2024-11-14 05:51:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 806 transitions. [2024-11-14 05:51:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2024-11-14 05:51:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 806 transitions. [2024-11-14 05:51:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 05:51:24,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:24,049 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1] [2024-11-14 05:51:24,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:51:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:24,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:24,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1107430224, now seen corresponding path program 2 times [2024-11-14 05:51:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991840153] [2024-11-14 05:51:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:24,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991840153] [2024-11-14 05:51:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991840153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:51:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735205903] [2024-11-14 05:51:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:24,514 INFO L87 Difference]: Start difference. First operand 441 states and 806 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:51:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:24,690 INFO L93 Difference]: Finished difference Result 441 states and 806 transitions. [2024-11-14 05:51:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13 [2024-11-14 05:51:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:24,696 INFO L225 Difference]: With dead ends: 441 [2024-11-14 05:51:24,697 INFO L226 Difference]: Without dead ends: 437 [2024-11-14 05:51:24,698 INFO L431 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 [2024-11-14 05:51:24,699 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:24,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-14 05:51:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-14 05:51:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 324 states have (on average 2.4753086419753085) internal successors, (802), 436 states have internal predecessors, (802), 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) [2024-11-14 05:51:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 802 transitions. [2024-11-14 05:51:24,738 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 802 transitions. Word has length 13 [2024-11-14 05:51:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:24,740 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 802 transitions. [2024-11-14 05:51:24,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 05:51:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 802 transitions. [2024-11-14 05:51:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:51:24,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:24,743 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-14 05:51:24,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:51:24,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -911428688, now seen corresponding path program 1 times [2024-11-14 05:51:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062450085] [2024-11-14 05:51:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:25,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062450085] [2024-11-14 05:51:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062450085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:51:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484463802] [2024-11-14 05:51:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:25,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:51:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:51:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:25,162 INFO L87 Difference]: Start difference. First operand 437 states and 802 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2024-11-14 05:51:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:25,304 INFO L93 Difference]: Finished difference Result 437 states and 802 transitions. [2024-11-14 05:51:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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 15 [2024-11-14 05:51:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:25,308 INFO L225 Difference]: With dead ends: 437 [2024-11-14 05:51:25,309 INFO L226 Difference]: Without dead ends: 395 [2024-11-14 05:51:25,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:25,311 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:25,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 11 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-14 05:51:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-14 05:51:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 304 states have (on average 2.375) internal successors, (722), 394 states have internal predecessors, (722), 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) [2024-11-14 05:51:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 722 transitions. [2024-11-14 05:51:25,340 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 722 transitions. Word has length 15 [2024-11-14 05:51:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:25,341 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 722 transitions. [2024-11-14 05:51:25,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2024-11-14 05:51:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 722 transitions. [2024-11-14 05:51:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:51:25,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:25,342 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-14 05:51:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:51:25,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash -911428687, now seen corresponding path program 1 times [2024-11-14 05:51:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427176005] [2024-11-14 05:51:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:25,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427176005] [2024-11-14 05:51:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427176005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:51:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797720711] [2024-11-14 05:51:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:25,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:51:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:51:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:51:25,824 INFO L87 Difference]: Start difference. First operand 395 states and 722 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-14 05:51:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:26,089 INFO L93 Difference]: Finished difference Result 395 states and 722 transitions. [2024-11-14 05:51:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:51:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 15 [2024-11-14 05:51:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:26,093 INFO L225 Difference]: With dead ends: 395 [2024-11-14 05:51:26,093 INFO L226 Difference]: Without dead ends: 370 [2024-11-14 05:51:26,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:51:26,095 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 116 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:26,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-14 05:51:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-14 05:51:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 293 states have (on average 2.303754266211604) internal successors, (675), 369 states have internal predecessors, (675), 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) [2024-11-14 05:51:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 675 transitions. [2024-11-14 05:51:26,111 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 675 transitions. Word has length 15 [2024-11-14 05:51:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:26,111 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 675 transitions. [2024-11-14 05:51:26,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-14 05:51:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 675 transitions. [2024-11-14 05:51:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:51:26,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:26,112 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:51:26,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -119590449, now seen corresponding path program 1 times [2024-11-14 05:51:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240730659] [2024-11-14 05:51:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:26,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240730659] [2024-11-14 05:51:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240730659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:51:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787588688] [2024-11-14 05:51:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:26,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:51:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:51:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:51:26,861 INFO L87 Difference]: Start difference. First operand 370 states and 675 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-14 05:51:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:27,215 INFO L93 Difference]: Finished difference Result 370 states and 675 transitions. [2024-11-14 05:51:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:51:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 05:51:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:27,221 INFO L225 Difference]: With dead ends: 370 [2024-11-14 05:51:27,221 INFO L226 Difference]: Without dead ends: 368 [2024-11-14 05:51:27,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:51:27,222 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:27,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:51:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-14 05:51:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-14 05:51:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 293 states have (on average 2.2969283276450514) internal successors, (673), 367 states have internal predecessors, (673), 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) [2024-11-14 05:51:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 673 transitions. [2024-11-14 05:51:27,240 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 673 transitions. Word has length 19 [2024-11-14 05:51:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:27,240 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 673 transitions. [2024-11-14 05:51:27,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-14 05:51:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 673 transitions. [2024-11-14 05:51:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:51:27,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:27,241 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:27,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:51:27,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:27,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -119590448, now seen corresponding path program 1 times [2024-11-14 05:51:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374898656] [2024-11-14 05:51:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:28,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374898656] [2024-11-14 05:51:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374898656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:51:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810445237] [2024-11-14 05:51:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:28,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:51:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:28,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:51:28,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:51:28,264 INFO L87 Difference]: Start difference. First operand 368 states and 673 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-14 05:51:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:28,607 INFO L93 Difference]: Finished difference Result 368 states and 673 transitions. [2024-11-14 05:51:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:51:28,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 05:51:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:28,612 INFO L225 Difference]: With dead ends: 368 [2024-11-14 05:51:28,612 INFO L226 Difference]: Without dead ends: 366 [2024-11-14 05:51:28,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:51:28,613 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:28,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:51:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-14 05:51:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-14 05:51:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 293 states have (on average 2.2901023890784984) internal successors, (671), 365 states have internal predecessors, (671), 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) [2024-11-14 05:51:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 671 transitions. [2024-11-14 05:51:28,630 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 671 transitions. Word has length 19 [2024-11-14 05:51:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:28,631 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 671 transitions. [2024-11-14 05:51:28,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-14 05:51:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 671 transitions. [2024-11-14 05:51:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:51:28,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:28,632 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:51:28,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:28,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1037715500, now seen corresponding path program 1 times [2024-11-14 05:51:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919384004] [2024-11-14 05:51:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:28,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:28,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919384004] [2024-11-14 05:51:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919384004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:28,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:51:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280608517] [2024-11-14 05:51:28,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:51:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:51:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:51:28,852 INFO L87 Difference]: Start difference. First operand 366 states and 671 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-14 05:51:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:29,033 INFO L93 Difference]: Finished difference Result 366 states and 671 transitions. [2024-11-14 05:51:29,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:51:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 21 [2024-11-14 05:51:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:29,037 INFO L225 Difference]: With dead ends: 366 [2024-11-14 05:51:29,038 INFO L226 Difference]: Without dead ends: 365 [2024-11-14 05:51:29,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:29,039 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:29,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-14 05:51:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-14 05:51:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 293 states have (on average 2.2866894197952217) internal successors, (670), 364 states have internal predecessors, (670), 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) [2024-11-14 05:51:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 670 transitions. [2024-11-14 05:51:29,055 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 670 transitions. Word has length 21 [2024-11-14 05:51:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:29,056 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 670 transitions. [2024-11-14 05:51:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-14 05:51:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 670 transitions. [2024-11-14 05:51:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:51:29,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:29,057 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:29,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:51:29,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1037715501, now seen corresponding path program 1 times [2024-11-14 05:51:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251037641] [2024-11-14 05:51:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:29,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:29,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251037641] [2024-11-14 05:51:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251037641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:29,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:29,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:51:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85791070] [2024-11-14 05:51:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:29,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:51:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:51:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:51:29,461 INFO L87 Difference]: Start difference. First operand 365 states and 670 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-14 05:51:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:29,650 INFO L93 Difference]: Finished difference Result 365 states and 670 transitions. [2024-11-14 05:51:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:51:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 21 [2024-11-14 05:51:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:29,656 INFO L225 Difference]: With dead ends: 365 [2024-11-14 05:51:29,656 INFO L226 Difference]: Without dead ends: 364 [2024-11-14 05:51:29,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:29,658 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:29,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-14 05:51:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-14 05:51:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 293 states have (on average 2.2832764505119454) internal successors, (669), 363 states have internal predecessors, (669), 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) [2024-11-14 05:51:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 669 transitions. [2024-11-14 05:51:29,671 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 669 transitions. Word has length 21 [2024-11-14 05:51:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:29,672 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 669 transitions. [2024-11-14 05:51:29,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-14 05:51:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 669 transitions. [2024-11-14 05:51:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:51:29,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:29,673 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:51:29,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1471333068, now seen corresponding path program 1 times [2024-11-14 05:51:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917319114] [2024-11-14 05:51:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:29,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917319114] [2024-11-14 05:51:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917319114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:51:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197161963] [2024-11-14 05:51:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:29,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:29,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:29,802 INFO L87 Difference]: Start difference. First operand 364 states and 669 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:29,933 INFO L93 Difference]: Finished difference Result 364 states and 669 transitions. [2024-11-14 05:51:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 05:51:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:29,937 INFO L225 Difference]: With dead ends: 364 [2024-11-14 05:51:29,938 INFO L226 Difference]: Without dead ends: 334 [2024-11-14 05:51:29,938 INFO L431 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 [2024-11-14 05:51:29,939 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:29,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-14 05:51:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-14 05:51:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 275 states have (on average 2.2218181818181817) internal successors, (611), 333 states have internal predecessors, (611), 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) [2024-11-14 05:51:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 611 transitions. [2024-11-14 05:51:29,955 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 611 transitions. Word has length 26 [2024-11-14 05:51:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:29,955 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 611 transitions. [2024-11-14 05:51:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 611 transitions. [2024-11-14 05:51:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:51:29,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:29,956 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:29,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:51:29,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1471333067, now seen corresponding path program 1 times [2024-11-14 05:51:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5544665] [2024-11-14 05:51:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:30,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5544665] [2024-11-14 05:51:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5544665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:51:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590122517] [2024-11-14 05:51:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:30,208 INFO L87 Difference]: Start difference. First operand 334 states and 611 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:30,343 INFO L93 Difference]: Finished difference Result 334 states and 611 transitions. [2024-11-14 05:51:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:30,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 05:51:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:30,348 INFO L225 Difference]: With dead ends: 334 [2024-11-14 05:51:30,348 INFO L226 Difference]: Without dead ends: 304 [2024-11-14 05:51:30,348 INFO L431 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 [2024-11-14 05:51:30,349 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:30,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-14 05:51:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-14 05:51:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 257 states have (on average 2.151750972762646) internal successors, (553), 303 states have internal predecessors, (553), 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) [2024-11-14 05:51:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 553 transitions. [2024-11-14 05:51:30,365 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 553 transitions. Word has length 26 [2024-11-14 05:51:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:30,366 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 553 transitions. [2024-11-14 05:51:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 553 transitions. [2024-11-14 05:51:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:51:30,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:30,367 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:51:30,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1601432536, now seen corresponding path program 1 times [2024-11-14 05:51:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513516802] [2024-11-14 05:51:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:31,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:31,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513516802] [2024-11-14 05:51:31,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513516802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:31,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:51:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679056344] [2024-11-14 05:51:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:31,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:51:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:51:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:51:31,131 INFO L87 Difference]: Start difference. First operand 304 states and 553 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-11-14 05:51:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:31,849 INFO L93 Difference]: Finished difference Result 349 states and 640 transitions. [2024-11-14 05:51:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:51:31,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2024-11-14 05:51:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:31,853 INFO L225 Difference]: With dead ends: 349 [2024-11-14 05:51:31,853 INFO L226 Difference]: Without dead ends: 330 [2024-11-14 05:51:31,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:51:31,854 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:31,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 70 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:51:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-14 05:51:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 315. [2024-11-14 05:51:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 268 states have (on average 2.1977611940298507) internal successors, (589), 314 states have internal predecessors, (589), 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) [2024-11-14 05:51:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 589 transitions. [2024-11-14 05:51:31,868 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 589 transitions. Word has length 27 [2024-11-14 05:51:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 589 transitions. [2024-11-14 05:51:31,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-11-14 05:51:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 589 transitions. [2024-11-14 05:51:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:51:31,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:31,870 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:31,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:51:31,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1601432537, now seen corresponding path program 1 times [2024-11-14 05:51:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248966549] [2024-11-14 05:51:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:32,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248966549] [2024-11-14 05:51:32,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248966549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:51:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715615986] [2024-11-14 05:51:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:32,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:51:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:51:32,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-14 05:51:32,926 INFO L87 Difference]: Start difference. First operand 315 states and 589 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-11-14 05:51:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:33,761 INFO L93 Difference]: Finished difference Result 330 states and 603 transitions. [2024-11-14 05:51:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:51:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2024-11-14 05:51:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:33,767 INFO L225 Difference]: With dead ends: 330 [2024-11-14 05:51:33,767 INFO L226 Difference]: Without dead ends: 311 [2024-11-14 05:51:33,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:51:33,770 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 85 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:33,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 33 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:51:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-14 05:51:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-14 05:51:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 264 states have (on average 2.143939393939394) internal successors, (566), 310 states have internal predecessors, (566), 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) [2024-11-14 05:51:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 566 transitions. [2024-11-14 05:51:33,787 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 566 transitions. Word has length 27 [2024-11-14 05:51:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:33,788 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 566 transitions. [2024-11-14 05:51:33,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2024-11-14 05:51:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 566 transitions. [2024-11-14 05:51:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:51:33,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:33,792 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:51:33,792 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1895198323, now seen corresponding path program 1 times [2024-11-14 05:51:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801574456] [2024-11-14 05:51:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:35,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801574456] [2024-11-14 05:51:35,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801574456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:35,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:35,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 05:51:35,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520121918] [2024-11-14 05:51:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:35,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:51:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:51:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:51:35,212 INFO L87 Difference]: Start difference. First operand 311 states and 566 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:36,126 INFO L93 Difference]: Finished difference Result 356 states and 653 transitions. [2024-11-14 05:51:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:51:36,127 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:51:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:36,129 INFO L225 Difference]: With dead ends: 356 [2024-11-14 05:51:36,130 INFO L226 Difference]: Without dead ends: 337 [2024-11-14 05:51:36,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:51:36,131 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:36,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 85 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:51:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-14 05:51:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2024-11-14 05:51:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 275 states have (on average 2.189090909090909) internal successors, (602), 321 states have internal predecessors, (602), 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) [2024-11-14 05:51:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 602 transitions. [2024-11-14 05:51:36,142 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 602 transitions. Word has length 28 [2024-11-14 05:51:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 602 transitions. [2024-11-14 05:51:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 602 transitions. [2024-11-14 05:51:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:51:36,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:36,144 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:51:36,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1895198322, now seen corresponding path program 1 times [2024-11-14 05:51:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497577668] [2024-11-14 05:51:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:37,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:37,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497577668] [2024-11-14 05:51:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497577668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:37,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:37,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 05:51:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061718891] [2024-11-14 05:51:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:37,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 05:51:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 05:51:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-14 05:51:37,732 INFO L87 Difference]: Start difference. First operand 322 states and 602 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:38,894 INFO L93 Difference]: Finished difference Result 397 states and 729 transitions. [2024-11-14 05:51:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:51:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:51:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:38,898 INFO L225 Difference]: With dead ends: 397 [2024-11-14 05:51:38,898 INFO L226 Difference]: Without dead ends: 378 [2024-11-14 05:51:38,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-14 05:51:38,899 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 92 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:38,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 25 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:51:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-14 05:51:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 318. [2024-11-14 05:51:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 271 states have (on average 2.1365313653136533) internal successors, (579), 317 states have internal predecessors, (579), 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) [2024-11-14 05:51:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 579 transitions. [2024-11-14 05:51:38,911 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 579 transitions. Word has length 28 [2024-11-14 05:51:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 579 transitions. [2024-11-14 05:51:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 579 transitions. [2024-11-14 05:51:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:51:38,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:38,912 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:38,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:51:38,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:38,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -906820011, now seen corresponding path program 1 times [2024-11-14 05:51:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953129689] [2024-11-14 05:51:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 05:51:39,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:39,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953129689] [2024-11-14 05:51:39,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953129689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:51:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060467294] [2024-11-14 05:51:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:39,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:51:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:51:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:51:39,422 INFO L87 Difference]: Start difference. First operand 318 states and 579 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:39,632 INFO L93 Difference]: Finished difference Result 318 states and 579 transitions. [2024-11-14 05:51:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:51:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-14 05:51:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:39,635 INFO L225 Difference]: With dead ends: 318 [2024-11-14 05:51:39,636 INFO L226 Difference]: Without dead ends: 301 [2024-11-14 05:51:39,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:51:39,637 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 195 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:39,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 5 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-14 05:51:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-14 05:51:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 260 states have (on average 2.1) internal successors, (546), 300 states have internal predecessors, (546), 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) [2024-11-14 05:51:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 546 transitions. [2024-11-14 05:51:39,649 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 546 transitions. Word has length 28 [2024-11-14 05:51:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 546 transitions. [2024-11-14 05:51:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:51:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 546 transitions. [2024-11-14 05:51:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:51:39,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:39,651 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:39,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:51:39,651 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-14 05:51:39,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1953351357, now seen corresponding path program 1 times [2024-11-14 05:51:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959017012] [2024-11-14 05:51:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:51:39,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:51:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:51:39,849 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:51:39,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:51:39,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-14 05:51:39,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-14 05:51:39,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-14 05:51:39,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-14 05:51:39,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-14 05:51:39,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-14 05:51:39,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-14 05:51:39,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-14 05:51:39,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-14 05:51:39,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-14 05:51:39,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-14 05:51:39,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-14 05:51:39,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-14 05:51:39,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-14 05:51:39,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-14 05:51:39,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-14 05:51:39,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-14 05:51:39,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-14 05:51:39,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-14 05:51:39,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-14 05:51:39,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-14 05:51:39,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-14 05:51:39,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-14 05:51:39,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-14 05:51:39,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-14 05:51:39,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:51:39,867 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:39,945 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 05:51:39,945 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:51:39,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:51:39 BasicIcfg [2024-11-14 05:51:39,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:51:39,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:51:39,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:51:39,951 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:51:39,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:20" (3/4) ... [2024-11-14 05:51:39,954 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 05:51:40,011 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:51:40,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:51:40,012 INFO L158 Benchmark]: Toolchain (without parser) took 22633.39ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 88.8MB in the beginning and 255.8MB in the end (delta: -167.0MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2024-11-14 05:51:40,013 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:51:40,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1148.35ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 48.1MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-14 05:51:40,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.88ms. Allocated memory is still 117.4MB. Free memory was 48.1MB in the beginning and 45.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:51:40,014 INFO L158 Benchmark]: Boogie Preprocessor took 67.57ms. Allocated memory is still 117.4MB. Free memory was 44.3MB in the beginning and 42.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:51:40,014 INFO L158 Benchmark]: RCFGBuilder took 1909.67ms. Allocated memory is still 117.4MB. Free memory was 42.3MB in the beginning and 69.4MB in the end (delta: -27.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-14 05:51:40,014 INFO L158 Benchmark]: TraceAbstraction took 19360.26ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 69.4MB in the beginning and 260.0MB in the end (delta: -190.6MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-14 05:51:40,015 INFO L158 Benchmark]: Witness Printer took 60.73ms. Allocated memory is still 402.7MB. Free memory was 260.0MB in the beginning and 255.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:51:40,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1148.35ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 48.1MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.88ms. Allocated memory is still 117.4MB. Free memory was 48.1MB in the beginning and 45.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.57ms. Allocated memory is still 117.4MB. Free memory was 44.3MB in the beginning and 42.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1909.67ms. Allocated memory is still 117.4MB. Free memory was 42.3MB in the beginning and 69.4MB in the end (delta: -27.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19360.26ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 69.4MB in the beginning and 260.0MB in the end (delta: -190.6MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. * Witness Printer took 60.73ms. Allocated memory is still 402.7MB. Free memory was 260.0MB in the beginning and 255.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=1, mutex={1:0}, p={-2:0}, slot={2:0}, x=1] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=2, mutex={1:0}, p={5:0}, slot={2:0}, x=2] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [\old(list)={-2:0}, \old(node)={5:0}, list={-2:0}, mutex={1:0}, node={5:0}, slot={2:0}, temp={0:0}] [L1241] 0 node->next = temp [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=8, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(x)=3, \result={5:0}, mutex={1:0}, p={-3:0}, slot={2:0}, x=3] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 96 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 955 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3736 IncrementalHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 362 mSDtfsCounter, 3736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=4, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 3364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 565 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 780/813 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 05:51:40,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b327e6a-ffb5-49b5-b1a7-84cb04075d90/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)